Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming

DOI10.3934/naco.2013.3.247zbMath1264.90139OpenAlexW2319397399MaRDI QIDQ1953150

Bing-sheng He, Xiao-Ming Yuan

Publication date: 7 June 2013

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2013.3.247

zbMATH Keywords

linearizationresolvent operatoralternating direction method of multipliersseparable convex programmingGaussian back substitution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization ⋮ Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications ⋮ A splitting method for the locality regularized semi-supervised subspace clustering ⋮ Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure ⋮ Real-time pricing for demand response in smart grid based on alternating direction method of multipliers ⋮ Modified alternating direction methods for the modified multiple-sets split feasibility problems ⋮ Two-step methods for image zooming using duality strategies ⋮ Unnamed Item ⋮ Alternating iterative methods for solving tensor equations with applications ⋮ A new algorithm for positive semidefinite matrix completion ⋮ A class of ADMM-based algorithms for three-block separable convex programming ⋮ A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions ⋮ A parameterized proximal point algorithm for separable convex optimization ⋮ A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints ⋮ Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction ⋮ Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning ⋮ Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem ⋮ Two-step fixed-point proximity algorithms for multi-block separable convex problems

This page was built for publication: Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming