A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming
From MaRDI portal
Publication:5886869
DOI10.1090/mcom/3822OpenAlexW4315631016MaRDI QIDQ5886869
Feng Ma, Shengjie Xu, Bing-sheng He, Xiao-Ming Yuan
Publication date: 11 April 2023
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.02723
Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Latent variable graphical model selection via convex optimization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Parallel alternating direction multiplier decomposition of convex programs
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- On Glowinski's open question on the alternating direction method of multipliers
- On the optimal linear convergence rate of a generalized proximal point algorithm
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Multiplier and gradient methods
- Atomic Decomposition by Basis Pursuit
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Method with Gaussian Back Substitution for Separable 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
- Lagrange Multiplier Approach to Variational Problems and Applications
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Modified Lagrangians in convex programming and their generalizations
- Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
- First-Order Methods in Optimization
- Proximal Decomposition Via Alternating Linearization
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- A splitting method for separable convex programming
- Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
- Practical Augmented Lagrangian Methods for Constrained Optimization
- An introduction to continuous optimization for imaging
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
