Local minima and convergence in low-rank semidefinite programming
From MaRDI portal
Publication:2487849
Recommendations
- Local minima of nonconvex problems
- Low-rank optimization on the cone of positive semidefinite matrices
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- Low-Rank Optimization With Convex Constraints
- Local convergence of alternating low‐rank optimization methods with overrelaxation
- The problem of semidefinite least squares with low rank
- Local Duality of Nonlinear Semidefinite Programming
- On the local stability of semidefinite relaxations
- On the simplicity and conditioning of low rank semidefinite programs
- A nonconvex exact relaxation of the semidefinite matrix rank minimization
Cites work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A Spectral Bundle Method for Semidefinite Programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- Bounds for the quadratic assignment problem using the bundle method
- Cones of diagonally dominant matrices
- Convex Analysis
- First- and second-order methods for semidefinite programming
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Matrix Analysis
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- QAPLIB-A quadratic assignment problem library
- Recent advances in the solution of quadratic assignment problems
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving a class of semidefinite programs via nonlinear programming
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Solving some large scale semidefinite programs via the conjugate residual method
- The cut polytope and the Boolean quadric polytope
Cited in
(only showing first 100 items - show all)- A novel method for a class of structured low-rank minimizations with equality constraint
- Using negative curvature in solving nonlinear programs
- Stochastic heavy ball
- ADMM for the SDP relaxation of the QAP
- Robust bilinear factorization with missing and grossly corrupted observations
- Flexible low-rank statistical modeling with missing data and side information
- Two proposals for robust PCA using semidefinite programming
- Online optimization for max-norm regularization
- Quartic first-order methods for low-rank minimization
- Adaptive regularization with cubics on manifolds
- On the Burer-Monteiro method for general semidefinite programs
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
- An extension of the angular synchronization problem to the heterogeneous setting
- Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- A brief introduction to manifold optimization
- Optimization for deep learning: an overview
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Using a factored dual in augmented Lagrangian methods for semidefinite programming
- Provable accelerated gradient method for nonconvex low rank optimization
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Optimality conditions for nonlinear semidefinite programming via squared slack variables
- A strengthened Barvinok-Pataki bound on SDP rank
- Structure methods for solving the nearest correlation matrix problem
- Block coordinate descent methods for semidefinite programming
- The state-of-the-art in conic optimization software
- Active subspace: toward scalable low-rank learning
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
- Low-rank optimization on the cone of positive semidefinite matrices
- Scalable low-rank semidefinite programming for certifiably correct machine perception
- Scalable low-rank representation
- Lifting for blind deconvolution in random mask imaging: identifiability and convex relaxation
- Finding graph embeddings by incremental low-rank semidefinite programming
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Robust PCA by manifold optimization
- A guide to conic optimisation and its applications
- Generalized conditional gradient for sparse estimation
- A class of multilevel structured low-rank approximation arising in material processing
- Adapting regularized low-rank models for parallel architectures
- A feasible filter method for the nearest low-rank correlation matrix problem
- Universal latent space model fitting for large networks with edge covariates
- Rank optimality for the Burer-Monteiro factorization
- How well do local algorithms solve semidefinite programs?
- Scalable semidefinite programming
- Compressive learning for patch-based image denoising
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Improved performance guarantees for orthogonal group synchronization via generalized power method
- Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
- On the simplicity and conditioning of low rank semidefinite programs
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Simultaneous phase retrieval and blind deconvolution via convex programming
- Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning
- Quotient geometry with simple geodesics for the manifold of fixed-rank positive-semidefinite matrices
- Nonconvex Robust Low-Rank Matrix Recovery
- Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- On the landscape of synchronization networks: a perspective from nonconvex optimization
- A proximal operator for multispectral phase retrieval problems
- Fixed point and Bregman iterative methods for matrix rank minimization
- First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules
- Computational enhancements in low-rank semidefinite programming
- A class of semidefinite programs with rank-one solutions
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
- Completely positive factorization by a Riemannian smoothing method
- Efficient joint object matching via linear programming
- An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs
- Fast certifiable relative pose estimation with gravity prior
- Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- A unified approach to synchronization problems over subgroups of the orthogonal group
- Solving graph equipartition SDPs on an algebraic variety
- Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization
- Max-Cut via Kuramoto-Type Oscillators
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
- Low-Rank Univariate Sum of Squares Has No Spurious Local Minima
- Guarantees for Spontaneous Synchronization on Random Geometric Graphs
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
- IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming
- Application of fermionic marginal constraints to hybrid quantum algorithms
- A Riemannian dimension-reduced second-order method with application in sensor network localization
- A feasible method for general convex low-rank SDP problems
- Global minimization of polynomial integral functionals
- Exploiting constant trace property in large-scale polynomial optimization
- Matrix completion from a computational statistics perspective
- Loraine – an interior-point solver for low-rank semidefinite programming
- The effect of smooth parametrizations on nonconvex optimization landscapes
- Tightness of SDP and Burer-Monteiro factorization for phase synchronization in a high-noise regime
- Optimization over convex polyhedra via Hadamard parametrizations
- Sparse sub-Gaussian random projections for semidefinite programming relaxations
- Improved global guarantees for the nonconvex Burer-Monteiro factorization via rank overparameterization
- Fast convergence to non-isolated minima: four equivalent conditions for \({\mathrm{C}^2}\) functions
- Adaptive primal-dual methods with an inexact oracle for relatively smooth optimization problems and their applications to recovering low-rank matrices
- Solving low-rank semidefinite programs via manifold optimization
This page was built for publication: Local minima and convergence in low-rank semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487849)
