A feasible method for general convex low-rank SDP problems

Cites Work

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
A feasible method for optimization with orthogonality constraints
Manopt, a Matlab toolbox for optimization on manifolds
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
Solving semidefinite-quadratic-linear programs using SDPT3
QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
A Newton-CG augmented Lagrangian method for semidefinite programming
Regularization methods for semidefinite programming
On the Shannon capacity of a graph
Title not available (Why is that?)
Local minima and convergence in low-rank semidefinite programming
Computational enhancements in low-rank semidefinite programming
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Problems of distance geometry and convex properties of quadratic maps
Complementarity and nondegeneracy in semidefinite programming
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Projection-like retractions on matrix manifolds
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
Low-rank optimization on the cone of positive semidefinite matrices
How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
Subspaces of symmetric matrices containing matrices with a multiple first eigenvalue
The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
Global rates of convergence for nonconvex optimization on manifolds
Riemannian Optimization on the Symplectic Stiefel Manifold
Optimality conditions for nonlinear semidefinite programming via squared slack variables
Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
On the Burer-Monteiro method for general semidefinite programs
A Riemannian rank-adaptive method for low-rank matrix completion
A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
Scalable Semidefinite Programming
Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
An Introduction to Optimization on Smooth Manifolds
Solving graph equipartition SDPs on an algebraic variety
A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem
Dissolving Constraints for Riemannian Optimization

This page was built for publication: A feasible method for general convex low-rank SDP problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573007)