Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming

DOI10.1186/s13660-018-1863-zzbMath1498.90158OpenAlexW2895058234WikidataQ58581239 ScholiaQ58581239MaRDI QIDQ824816

Min Sun, Y. J. Wang

Publication date: 15 December 2021

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-018-1863-z

zbMATH Keywords

global convergenceaugmented Lagrangian methodstep sizethree-block separable convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Cites Work

• An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
• The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
• Convergent prediction-correction-based ADMM for multi-block separable convex programming
• Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
• Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming
• Traditional and recent approaches in background modeling for foreground detection: an overview
• A partial splitting augmented Lagrangian method for low patch-rank image decomposition
• Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
• On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
• An accelerated proximal augmented Lagrangian method and its application in compressive sensing
• Multiplier and gradient methods
• A proximal Peaceman-Rachford splitting method for compressive sensing
• A customized proximal point algorithm for convex minimization with linear constraints
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
• Atomic Decomposition by Basis Pursuit
• A splitting method for separable convex programming
• A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
• A proximal partially parallel splitting method for separable convex programs
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA

This page was built for publication: Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming