Solving graph equipartition SDPs on an algebraic variety
From MaRDI portal
Publication:6120843
DOI10.1007/s10107-023-01952-6arXiv2112.04256MaRDI QIDQ6120843
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.04256
singular pointalgebraic varietyRiemannian optimizationgraph equipartitionBurer and Monteiro methodlow rank SDP
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- On the second-order directional derivatives of singular values of matrices and symmetric matrix-valued functions
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Subspaces of symmetric matrices containing matrices with a multiple first eigenvalue
- Problems of distance geometry and convex properties of quadratic maps
- Semidefinite programming in combinatorial optimization
- Sensitivity analysis of generalized equations
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Simple algorithms for optimization on Riemannian manifolds with constraints
- On the Burer-Monteiro method for general semidefinite programs
- A brief introduction to manifold optimization
- An introduction to a class of matrix cone programming
- Local minima and convergence in low-rank semidefinite programming
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Manopt, a Matlab toolbox for optimization on manifolds
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Approximate graph coloring by semidefinite programming
- First Order Conditions for General Nonlinear Optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- A Spectral Bundle Method for Semidefinite Programming
- The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Multi-Scale attributed node embedding
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Semidefinite programming and combinatorial optimization
