A note on augmented Lagrangian-based parallel splitting method
From MaRDI portal
Publication:497450
DOI10.1007/S11590-014-0825-8zbMATH Open1323.90053OpenAlexW2039239773MaRDI QIDQ497450FDOQ497450
Authors: 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
Recommendations
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- On the convergence rate of the augmented Lagrangian-based parallel splitting method
- A parallel splitting ALM-based algorithm for separable convex programming
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
Cites Work
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Sparsity and Smoothness Via the Fused Lasso
- Convex analysis and monotone operator theory in Hilbert spaces
- Introductory lectures on convex optimization. A basic course.
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Multiplier and gradient methods
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Monotone Operators and the Proximal Point Algorithm
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- Title not available (Why is that?)
- Distributed Subgradient Methods for Multi-Agent Optimization
- 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
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Canonical duality for solving general nonconvex constrained problems
- A note on the alternating direction method of multipliers
- 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
- Entropic proximal decomposition methods for convex programs and variational inequalities
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
- 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
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
- Structured linear algebra problems in adaptive optics imaging
Cited In (10)
- A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
- 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
- On the convergence rate of the augmented Lagrangian-based parallel splitting method
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures
- A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- A proximal partially parallel splitting method for separable convex programs
- A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization
This page was built for publication: A note on augmented Lagrangian-based parallel splitting method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497450)
