Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers
DOI10.1007/s10957-018-1232-6zbMath1433.90112MaRDI QIDQ725878
Max L. N. Gonçalves, Jefferson G. Melo, Maicon Marques Alves
Publication date: 2 August 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1232-6
convex program; alternating direction method of multipliers; hybrid proximal extragradient method; variable metric; pointwise and ergodic convergence rates
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
47J22: Variational and other types of inclusions
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
- An extragradient-based alternating direction method for convex minimization
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- On the maximal monotonicity of subdifferential mappings
- An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- A Class of Inexact Variable Metric Proximal Point Algorithms
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Convergence Rate Analysis of Several Splitting Schemes
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
- Convex Analysis