On the convergence rate of the augmented Lagrangian-based parallel splitting method

DOI10.1080/10556788.2017.1370711zbMath1407.65069OpenAlexW2754965690MaRDI QIDQ4622886

Kai Wang, Jitamitra Desai

Publication date: 18 February 2019

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2017.1370711

zbMATH Keywords

convergence rateaugmented Lagrangian methodJacobian decompositionparallel splitting methodglobal linear convergenceseparable convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items (1)

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

Uses Software

• LMaFit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Gradient methods for minimizing composite functions
• A note on augmented Lagrangian-based parallel splitting method
• Structured linear algebra problems in adaptive optics imaging
• A fast splitting method tailored for Dantzig selector
• On the sublinear convergence rate of multi-block ADMM
• A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
• On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
• On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
• Multiplier and gradient methods
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• 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
• Sparsity and Smoothness Via the Fused Lasso
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Distributed Subgradient Methods for Multi-Agent Optimization
• A proximal partially parallel splitting method for separable convex programs
• An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization
• On the Global Linear Convergence of the ADMM with MultiBlock Variables
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
• A distributed Douglas-Rachford splitting method for multi-block convex minimization problems

This page was built for publication: On the convergence rate of the augmented Lagrangian-based parallel splitting method