Accelerated first-order methods for a class of semidefinite programs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Smooth minimization of non-smooth functions
Conic optimization via operator splitting and homogeneous self-dual embedding
A linear-time algorithm for trust region problems
On the ergodic convergence rates of a first-order primal-dual algorithm
Exactness conditions for an SDP relaxation of the extended trust region problem
First-order methods of smooth convex optimization with inexact oracle
A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
How to convexify the intersection of a second order cone and a nonconvex quadratic
Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
Lectures on convex optimization
On general minimax theorems
Large-scale semidefinite programming via a saddle point mirror-prox algorithm
Dual quadratic estimates in polynomial and Boolean programming
Complementarity and nondegeneracy in semidefinite programming
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
On a positive semidefinite relaxation of the cut polytope
On the Burer-Monteiro method for general semidefinite programs
The generalized trust region subproblem: solution complexity and convex hull results
On the tightness of SDP relaxations of QCQPs
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
The trust region subproblem with non-intersecting linear constraints
Lectures on Modern Convex Optimization
Low-Rank Spectral Optimization via Gauge Duality
A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems
A Stochastic Smoothing Algorithm for Semidefinite Programming
Exact Recovery in the Stochastic Block Model
Computing a Trust Region Step
Interior Point Trajectories in Semidefinite Programming
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Clustering subgaussian mixtures by semidefinite programming
Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization
Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Semidefinite Programming
Rank Optimality for the Burer--Monteiro Factorization
A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
Scalable Semidefinite Programming
Memory-Efficient Structured Convex Optimization via Extreme Point Sampling
On the Simplicity and Conditioning of Low Rank Semidefinite Programs
An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP
Excessive Gap Technique in Nonsmooth Convex Minimization
A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
Quadratic Matrix Programming
On Cones of Nonnegative Quadratic Functions
The measure of the critical values of differentiable maps
Phase Retrieval via Matrix Completion
KKT-based primal-dual exactness conditions for the Shor relaxation
Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
Necessary and Sufficient Conditions for Rank-One-Generated Cones

This page was built for publication: Accelerated first-order methods for a class of semidefinite programs