Memory-Efficient Structured Convex Optimization via Extreme Point Sampling
From MaRDI portal
Publication:5154636
DOI10.1137/20M1358037zbMath1478.90091arXiv2006.10945WikidataQ114615451 ScholiaQ114615451MaRDI QIDQ5154636
Nimita Shinde, Vishnu Narayanan, James Saunderson
Publication date: 5 October 2021
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.10945
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Angular synchronization by eigenvectors and semidefinite programming
- Correlation clustering
- Positive semidefinite matrices with a given sparsity pattern
- Problems of distance geometry and convex properties of quadratic maps
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Compressive sensing in signal processing: algorithms and transform domain formulations
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Relax, No Need to Round
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Robust Control via Sequential Semidefinite Programming
- Sensor Selection via Convex Optimization
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Semidefinite Programming
- Rank Optimality for the Burer--Monteiro Factorization
- Scalable Semidefinite Programming
- Global rates of convergence for nonconvex optimization on manifolds
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
- Database Theory - ICDT 2005
- Do Sums of Squares Dream of Free Resolutions?
- Multi-view Regression Via Canonical Correlation Analysis
- Sparse Approximate Solutions to Semidefinite Programs
This page was built for publication: Memory-Efficient Structured Convex Optimization via Extreme Point Sampling
