A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
Publication:5962721
DOI10.1007/s10107-014-0850-5zbMath1342.90134arXiv1409.2679OpenAlexW2093499918MaRDI QIDQ5962721
Defeng Sun, Xudong Li, Kim-Chuan Toh
Publication date: 23 February 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.2679
Schur complementconvex quadratic conic programmingmultiple-block ADMMquadratic semidefinite programmingsemi-proximal ADMM
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10)
Related Items (67)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Lectures on numerical methods for non-linear variational problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
- Noisy low-rank matrix completion with general sampling distribution
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Local Duality of Nonlinear Semidefinite Programming
- Nonsingularity Conditions for the Fischer–Burmeister System of Nonlinear SDPs
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
This page was built for publication: A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions