An inexact proximal generalized alternating direction method of multipliers
From MaRDI portal
Publication:2191781
DOI10.1007/s10589-020-00191-1zbMath1445.90077MaRDI QIDQ2191781
Jefferson G. Melo, V. A. Adona, Max L. N. Gonçalves
Publication date: 26 June 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00191-1
convex program; relative error criterion; generalized alternating direction method of multipliers; ergodic iteration-complexity; pointwise iteration-complexity
90C25: Convex programming
90C60: Abstract computational complexity for mathematical programming problems
65K10: Numerical optimization and variational techniques
47H05: Monotone operators and generalizations
49M27: Decomposition methods
Related Items
On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error, An inexact ADMM with proximal-indefinite term and larger stepsize, On FISTA with a relative error rule
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A practical relative error criterion for augmented Lagrangians
- An inexact alternating direction method of multipliers with relative error criteria
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Approximate ADMM algorithms derived from Lagrangian splitting
- The Lasso problem and uniqueness
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
- A proximal point analysis of the preconditioned alternating direction method of multipliers
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Iteration-complexity analysis of a generalized alternating direction method of multipliers
- Convex Analysis
