An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
From MaRDI portal
Publication:5162656
DOI10.1137/19M1244603zbMath1480.90188arXiv1902.03373OpenAlexW3209515688MaRDI QIDQ5162656
Volkan Cevher, Joel A. Tropp, A. Yurtsever, Lijun Ding, Madeleine Udell
Publication date: 5 November 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.03373
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Numerical methods based on necessary conditions (49M05)
Related Items
Learning Dynamical Systems with Side Information, A hierarchy of spectral relaxations for polynomial optimization, Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, A strict complementarity approach to error bound and sensitivity of solution of conic programs, On optimal universal first-order methods for minimizing heterogeneous sums
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Problems of distance geometry and convex properties of quadratic maps
- Complementarity and nondegeneracy in semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Introductory lectures on convex optimization. A basic course.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Faster subgradient methods for functions with Hölderian growth
- Local minima and convergence in low-rank semidefinite programming
- Phase recovery, MaxCut and complex semidefinite programming
- Exact matrix completion via convex optimization
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Low-Rank Spectral Optimization via Gauge Duality
- .879-approximation algorithms for MAX CUT and MAX 2SAT
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Matrix-Free Convex Optimization Modeling
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Array imaging using intensity-only measurements
- Semidefinite optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Monotone Operators and the Proximal Point Algorithm
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Spectral Bundle Method for Semidefinite Programming
- Error Bounds for Linear Matrix Inequalities
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Rank Optimality for the Burer--Monteiro Factorization
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Scalable Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- A useful variant of the Davis–Kahan theorem for statisticians
- Matrix Completion From a Few Entries
- Sparse Approximate Solutions to Semidefinite Programs
- Learning Theory
- Phase Retrieval via Matrix Completion
