On Glowinski's open question on the alternating direction method of multipliers
From MaRDI portal
Publication:1730806
DOI10.1007/s10957-018-1338-xzbMath1407.90259OpenAlexW2814844821MaRDI QIDQ1730806
Publication date: 6 March 2019
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-1338-x
quadratic programminglinear convergencealternating direction method of multipliersstep sizeGlowinski's open question
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming ⋮ The symmetric ADMM with indefinite proximal regularization and its application ⋮ Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems ⋮ Unnamed Item ⋮ A proximal fully parallel splitting method with a relaxation factor for separable convex programming ⋮ Convergence study on the proximal alternating direction method with larger step size ⋮ The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex ⋮ An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems ⋮ Convergence study of indefinite proximal ADMM with a relaxation factor
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Alternating direction augmented Lagrangian methods for semidefinite programming
- On the equality of algebraic and geometric multiplicities of matrix eigenvalues
- The generalized proximal point algorithm with step size 2 is not necessarily convergent
- 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
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- Proximal alternating directions method for structured variational inequalities
- Interactive decision support in radiation therapy treatment planning
- Multiplier and gradient methods
- Splitting Methods in Communication, Imaging, Science, and Engineering
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Monotone Operators and the Proximal Point Algorithm
- Modified Lagrangians in convex programming and their generalizations
- Bounds for the Determinant of the Sum of Hermitian Matrices
- On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- 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
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
