DeepAI AI Chat
Log In Sign Up

A Riemannian low-rank method for optimization over semidefinite matrices with block-diagonal constraints

by   Nicolas Boumal, et al.
Cole Normale Suprieure

We propose a new algorithm to solve optimization problems of the form f(X) for a smooth function f under the constraints that X is positive semidefinite and the diagonal blocks of X are small identity matrices. Such problems often arise as the result of relaxing a rank constraint (lifting). In particular, many estimation tasks involving phases, rotations, orthonormal bases or permutations fit in this framework, and so do certain relaxations of combinatorial problems such as Max-Cut. The proposed algorithm exploits the facts that (1) such formulations admit low-rank solutions, and (2) their rank-restricted versions are smooth optimization problems on a Riemannian manifold. Combining insights from both the Riemannian and the convex geometries of the problem, we characterize when second-order critical points of the smooth problem reveal KKT points of the semidefinite problem. We compare against state of the art, mature software and find that, on certain interesting problem instances, what we call the staircase method is orders of magnitude faster, is more accurate and scales better. Code is available.


Multilevel Riemannian optimization for low-rank problems

Large-scale optimization problems arising from the discretization of pro...

The effect of smooth parametrizations on nonconvex optimization landscapes

We develop new tools to study the landscapes of nonconvex optimization p...

Efficiently escaping saddle points on manifolds

Smooth, non-convex optimization problems on Riemannian manifolds occur i...

Block-Coordinate Minimization for Large SDPs with Block-Diagonal Constraints

The so-called Burer-Monteiro method is a well-studied technique for solv...

Low-rank semidefinite programming for the MAX2SAT problem

This paper proposes a new algorithm for solving MAX2SAT problems based o...

Smoothed analysis of the low-rank approach for smooth semidefinite programs

We consider semidefinite programs (SDPs) of size n with equality constra...

A Grassmann Manifold Handbook: Basic Geometry and Computational Aspects

The Grassmann manifold of linear subspaces is important for the mathemat...