A note on augmented Lagrangian-based parallel splitting method
From MaRDI portal
Publication:497450
DOI10.1007/s11590-014-0825-8zbMath1323.90053OpenAlexW2039239773MaRDI QIDQ497450
Jitamitra Desai, Hongjin He, Kai Wang
Publication date: 24 September 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0825-8
Related Items (5)
On the convergence rate of the augmented Lagrangian-based parallel splitting method ⋮ A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization ⋮ Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit ⋮ A new convergence proof of augmented Lagrangian-based method with full Jacobian decomposition for structured variational inequalities ⋮ A proximal partially parallel splitting method for separable convex programs
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Canonical duality for solving general nonconvex constrained problems
- Structured linear algebra problems in adaptive optics imaging
- Introductory lectures on convex optimization. A basic course.
- A note on the alternating direction method of multipliers
- A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- Multiplier and gradient methods
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
- 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
- Monotone Operators and the Proximal Point Algorithm
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
- Sparsity and Smoothness Via the Fused Lasso
- Distributed Subgradient Methods for Multi-Agent Optimization
- An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Entropic proximal decomposition methods for convex programs and variational inequalities
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
This page was built for publication: A note on augmented Lagrangian-based parallel splitting method
