Solving low-rank semidefinite programs via manifold optimization

DOI10.1007/S10915-025-02952-8MaRDI QIDQ6951382zbMATH OpenFDO

Authors Jie Wang, Liangbing Hu

Publication date 29 July 2025

Published in Journal of Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

polynomial optimizationsemidefinite programmingaugmented Lagrangian methodmanifold optimizationlow-rank solutionmoment-SOS relaxationBurer-Monteiro factorization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Semidefinite programming (90C22) Polynomial optimization (90C23)

Cites work

• A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
• A Spectral Bundle Method for Semidefinite Programming
• A convex relaxation to compute the nearest structured rank deficient matrix
• A feasible method for general convex low-rank SDP problems
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
• A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
• Alternating direction augmented Lagrangian methods for semidefinite programming
• An Extrinsic Look at the Riemannian Hessian
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• COSMO: a conic operator splitting method for convex conic problems
• CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
• Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
• Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting
• Global optimization with polynomials and the problem of moments
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Local minima and convergence in low-rank semidefinite programming
• Low-rank optimization on the cone of positive semidefinite matrices
• Manopt, a Matlab toolbox for optimization on manifolds
• On implementing a primal-dual interior-point method for conic quadratic optimization
• On the Burer-Monteiro method for general semidefinite programs
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
• On the local stability of semidefinite relaxations
• 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
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Scalable low-rank semidefinite programming for certifiably correct machine perception
• Scalable semidefinite programming
• Semidefinite Programming
• Semidefinite programming in combinatorial optimization
• Semidefinite programming relaxations and algebraic optimization in control
• Simple algorithms for optimization on Riemannian manifolds with constraints
• Solving graph equipartition SDPs on an algebraic variety
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
• Structured low-rank approximation and its applications
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Trust-region methods on Riemannian manifolds

Cited in

(1)

• Safe consensus control for stochastic networked systems

This page was built for publication: Solving low-rank semidefinite programs via manifold optimization

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