Critical points of quadratic low-rank optimization problems (André Uschmajew - Max Planck MIS, Leipzig)

19.03.2019 14:00 – 15:00

The absence of spurious local minima in certain non-convex minimization problems, e.g. in the context of recovery problems in compressed sensing, has recently triggered much interest due to its important implications on the global convergence of optimization algorithms. One example is low-rank matrix sensing under rank restricted isometry properties. It can be formulated as a minimization problem for a quadratic cost function constrained to a low-rank matrix manifold, with a positive semidefinite Hessian acting like a perturbation of identity on cones of low-rank matrices. We present an approach to show strict saddle point properties and absence of spurious local minima for such problems under improved conditions on the restricted isometry constants. This is joint work with Bart Vandereycken.


Room 623, Séminaire d'analyse numérique

Organisé par

Section de mathématiques


André Uschmajew, Max Planck MIS, Leipzig

entrée libre


Catégorie: Séminaire

Mots clés: analyse numérique