An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate
From MaRDI portal
Publication:4629373
DOI10.1090/mcom/3388zbMath1414.90272OpenAlexW2813079518MaRDI QIDQ4629373
Publication date: 22 March 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3388
convex programmingconvergence rateaccelerationalternating direction method of multipliersfirst order methods
Related Items (4)
A survey on some recent developments of alternating direction method of multipliers ⋮ A two-level distributed algorithm for nonconvex constrained optimization ⋮ An accelerated primal-dual iterative scheme for the L 2 -TV regularized model of linear inverse problems ⋮ An explicit algorithm for solving monotone variational inequalities
Cites Work
- 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
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Gradient methods for minimizing composite functions
- A unified primal-dual algorithm framework based on Bregman iteration
- 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 new inexact alternating directions method for monotone variational inequalities
- Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation
- On the optimal linear convergence rate of a generalized proximal point algorithm
- 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
- Multiplier and gradient methods
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth 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
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Fast Alternating Direction Optimization Methods
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- A Generalized Proximal Point Algorithm and Its Convergence Rate
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Convergence Rate Analysis of Several Splitting Schemes
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- Proximité et dualité dans un espace hilbertien
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate
