A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
From MaRDI portal
Publication:1741112
DOI10.1007/s12532-018-0134-9zbMath1411.90260arXiv1507.05691OpenAlexW2963959562MaRDI QIDQ1741112
Liang Chen, Dong-hui Li, Yun-hai Xiao
Publication date: 3 May 2019
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.05691
relaxationalternating direction method of multiplierssemi-proximal termsconvex composite conic programmingdoubly non-negative semidefinite programming
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Related Items
Convergence analysis on a modified generalized alternating direction method of multipliers ⋮ Efficient dual ADMMs for sparse compressive sensing MRI reconstruction ⋮ An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond ⋮ A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance ⋮ Portfolio Selection with Regularization ⋮ An inexact ADMM with proximal-indefinite term and larger stepsize
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- A note on the convergence of ADMM for linearly constrained convex optimization problems
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A boundary point method to solve semidefinite programs
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
- 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
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Multiplier and gradient methods
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
