Smoothed analysis of the low-rank approach for smooth semidefinite programs
Thomas Pumir, Samy Jelassi, Nicolas Boumal
–Neural Information Processing Systems
Inprior work, ithas been shown that, when the constraints on the factorized variable regularly define a smooth manifold, providedk is large enough, for almost all cost matrices, all second-order stationary points (SOSPs) are optimal. Importantly, in practice, one can only compute points which approximately satisfy necessary optimality conditions, leading tothequestion: aresuch points also approximately optimal?
Neural Information Processing Systems
Feb-13-2026, 23:42:00 GMT
- Country:
- Asia > Middle East
- Jordan (0.04)
- Europe > Netherlands
- North Holland > Amsterdam (0.04)
- North America
- Canada > Quebec
- Montreal (0.04)
- United States > Massachusetts
- Middlesex County > Cambridge (0.04)
- Canada > Quebec
- Asia > Middle East
- Technology: