An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems

DOI10.1007/s00186-022-00796-8OpenAlexW4296459912MaRDI QIDQ2105290

Yaning Jiang, Deren Han, Xing-Ju Cai

Publication date: 8 December 2022

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-022-00796-8

zbMATH Keywords

convex programmingconvergence ratealternating direction method of multiplierspartially parallel splitting method

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
• A parallel splitting method for separable convex programs
• A class of ADMM-based algorithms for three-block separable convex programming
• Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
• On the sublinear convergence rate of multi-block ADMM
• Parallel multi-block ADMM with \(o(1/k)\) convergence
• A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming
• Generalized symmetric ADMM for separable convex optimization
• A note on the alternating direction method of multipliers
• A proximal fully parallel splitting method for stable principal component pursuit
• On the convergence analysis of the alternating direction method of multipliers with three blocks
• A partially proximal S-ADMM for separable convex optimization with linear constraints
• A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization
• A partial splitting augmented Lagrangian method for low patch-rank image decomposition
• On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
• Alternating proximal gradient method for convex minimization
• A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions
• Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
• Handbook of Robust Low-Rank and Sparse Matrix Decomposition
• An alternating direction-based contraction method for linearly constrained separable convex programming problems
• A Low Patch-Rank Interpretation of Texture
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
• Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
• On the convergence rate of the augmented Lagrangian-based parallel splitting method
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Metric Subregularity of Piecewise Linear Multifunctions and Applications to Piecewise Linear Multiobjective Optimization
• A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization
• A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems
• 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
• Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
• Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
• Convex analysis and monotone operator theory in Hilbert spaces
• 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: An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems