An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming
From MaRDI portal
Publication:2805705
DOI10.1137/15M1021799zbMath1346.90658arXiv1505.04278OpenAlexW1499687860MaRDI QIDQ2805705
Kim-Chuan Toh, Defeng Sun, Liuqin Yang
Publication date: 13 May 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04278
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Iterative numerical methods for linear systems (65F10)
Related Items
An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications, An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs, An efficient augmented Lagrangian method for support vector machine, QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming, An efficient duality-based approach for PDE-constrained sparse optimization, An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming, An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost, A proximal augmented method for semidefinite programming problems, A Euclidean distance matrix model for protein molecular conformation, Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent, Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A coordinate gradient descent method for nonsmooth separable minimization
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- Introductory lectures on convex optimization. A basic course.
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Dual coordinate ascent methods for non-strictly convex minimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Accelerated, Parallel, and Proximal Coordinate Descent
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Frequency planning and ramifications of coloring
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
- On the Convergence of Block Coordinate Descent Type Methods
- Approximating K‐means‐type Clustering via Semidefinite Programming
- The Theory of Max-Min, with Applications
- Convex Analysis
- Convergence of a block coordinate descent method for nondifferentiable minimization
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
