A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers
From MaRDI portal
Publication:6151015
Recommendations
- A practical general approximation criterion for methods of multipliers based on Bregman distances
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
- Robust Stopping Criteria for Dykstra's Algorithm
Cites work
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A note on the alternating direction method of multipliers
- A note on the convergence of ADMM for linearly constrained convex optimization problems
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- A survey on some recent developments of alternating direction method of multipliers
- A unified primal-dual algorithm framework based on Bregman iteration
- Alternating direction method for covariance selection models
- Alternating direction method for image inpainting in wavelet domains
- An accelerated linearized alternating direction method of multipliers
- An inertial alternating direction method of multipliers
- Consensus-based distributed support vector machines
- Convex Analysis
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Inertial proximal ADMM for linearly constrained separable convex optimization
- Inexact alternating direction methods for image recovery
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Monotone Operators and the Proximal Point Algorithm
- On alternating direction methods of multipliers: a historical perspective
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Parallel alternating direction multiplier decomposition of convex programs
- Partial error bound conditions and the linear convergence rate of the alternating direction method of multipliers
- Restoration of Poissonian Images Using Alternating Direction Optimization
- Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
- Solving large-scale least squares semidefinite programming by alternating direction methods
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
This page was built for publication: A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151015)
