Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
From MaRDI portal
Publication:5397620
DOI10.1137/120886753zbMath1285.90033OpenAlexW2080902082MaRDI QIDQ5397620
Publication date: 24 February 2014
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120886753
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items
Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems ⋮ Structured backward error analysis for a class of block three-by-three saddle point problems ⋮ Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints ⋮ Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers ⋮ On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function ⋮ Unnamed Item ⋮ On the linear convergence of the general first order primal-dual algorithm ⋮ Alternating proximal gradient method for convex minimization ⋮ On the information-adaptive variants of the ADMM: an iteration complexity perspective ⋮ General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems ⋮ Spectral analysis of the preconditioned system for the \(3 \times 3\) block saddle point problem ⋮ Sparse broadband beamformer design via proximal optimization Techniques ⋮ Convergence of ADMM for multi-block nonconvex separable optimization models ⋮ A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP ⋮ A note on preconditioning for the \(3\times 3\) block saddle point problem ⋮ Extensive generalized shift-splitting preconditioner for \(3 \times 3\) block saddle point problems ⋮ \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers ⋮ A simplified relaxed alternating positive semi-definite splitting preconditioner for saddle point problems with three-by-three block structure ⋮ Minimum residual two-parameter TSCSP method for solving complex symmetric linear systems ⋮ A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers ⋮ A block triangular preconditioner for a class of three-by-three block saddle point problems ⋮ A modified alternating positive semidefinite splitting preconditioner for block three-by-three saddle point problems ⋮ Two block preconditioners for a class of double saddle point linear systems ⋮ A modified preconditioner for three-by-three block saddle point problems ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ A new block triangular preconditioner for three-by-three block saddle-point problem. ⋮ Some results about the isolated calmness of a mixed variational inequality problem ⋮ An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate ⋮ Distributed model predictive control for continuous‐time nonlinear systems based on suboptimal ADMM ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ On Glowinski's open question on the alternating direction method of multipliers ⋮ Unnamed Item ⋮ On the optimal linear convergence rate of a generalized proximal point algorithm ⋮ Convergent prediction-correction-based ADMM for multi-block separable convex programming ⋮ Local linear convergence of an ADMM-type splitting framework for equality constrained optimization ⋮ Comparison of several fast algorithms for projection onto an ellipsoid ⋮ An operator splitting method for monotone variational inequalities with a new perturbation strategy ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ Fast algorithms for sparse portfolio selection considering industries and investment styles ⋮ A parallel operator splitting algorithm for solving constrained total-variation retinex ⋮ Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems ⋮ Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM ⋮ Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming ⋮ Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems ⋮ Variable splitting based method for image restoration with impulse plus Gaussian noise ⋮ On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints ⋮ Generalized alternating direction method of multipliers: new theoretical insights and applications ⋮ An extended proximal ADMM algorithm for three-block nonconvex optimization problems ⋮ Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming ⋮ Preconditioned proximal point methods and notions of partial subregularity ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints ⋮ A new block-diagonal preconditioner for a class of \(3\times 3\) block saddle point problems ⋮ Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming ⋮ On the Global Linear Convergence of the ADMM with MultiBlock Variables ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ Unnamed Item
