A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers

DOI10.1007/s40305-022-00417-5OpenAlexW4280581370MaRDI QIDQ6151015

Xiaoya Zhang, Xinxin Li

Publication date: 9 February 2024

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-022-00417-5

zbMATH Keywords

convex optimizationstopping criterionproximal point algorithmgeneralized alternating direction method of multipliers

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A note on the convergence of ADMM for linearly constrained convex optimization problems
• 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
• Parallel alternating direction multiplier decomposition of convex programs
• A note on the alternating direction method of multipliers
• 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
• Alternating direction method for covariance selection models
• Generalized alternating direction method of multipliers: new theoretical insights and applications
• An inertial alternating direction method of multipliers
• Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
• Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• Inexact Alternating Direction Methods for Image Recovery
• Alternating Direction Method for Image Inpainting in Wavelet Domains
• Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
• Monotone Operators and the Proximal Point Algorithm
• Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
• An Accelerated Linearized Alternating Direction Method of Multipliers
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• Restoration of Poissonian Images Using Alternating Direction Optimization
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Convex Analysis
• Navigating in a Graph by Aid of Its Spanning Tree Metric
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

This page was built for publication: A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers