Mathieu Besançon

Discrete eigenvalue optimization from entropic smoothing and first-order methods

We study the maximization of the minimum eigenvalue under combinatorial and integrality constraints. We propose a new approach based on branch-and-bound combines entropic smoothing of the minimum eigenvalue function and Frank-Wolfe methods over concave relaxations of the constraints, thereby exploiting combinatorial st...