On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
From MaRDI portal
Publication:5221273
DOI10.1080/02331934.2019.1652297zbMath1433.90203OpenAlexW2967133331MaRDI QIDQ5221273
Jefferson G. Melo, Renato D. C. Monteiro, Max L. N. Gonçalves
Publication date: 25 March 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1652297
alternating direction method of multipliershybrid proximal extragradient methoditeration-complexitynon-Euclidean Bregman distances
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Decomposition methods (49M27)
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 unified primal-dual algorithm framework based on Bregman iteration
- 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
- 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 Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- 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
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- 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
- Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- Monotone Operators and the Proximal Point Algorithm
- An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems
- The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
