Local linear convergence of an ADMM-type splitting framework for equality constrained optimization

DOI10.1007/s40305-019-00271-yzbMath1488.65146OpenAlexW2980542309MaRDI QIDQ2240104

Yin Zhang, Junfeng Yang

Publication date: 5 November 2021

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-019-00271-y

zbMATH Keywords

spectral radiusalternating direction method of multipliersstationary iterationslocal linear convergencenonlinear splitting

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Uses Software

• LMaFit

Cites Work

• Unnamed Item
• Unnamed Item
• 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 linear convergence of the alternating direction method of multipliers
• An alternating direction algorithm for matrix completion with nonnegative factors
• 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
• On gradients of functions definable in o-minimal structures
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Convergence of ADMM for multi-block nonconvex separable optimization models
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Convergence of a class of stationary iterative methods for saddle point problems
• On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Multiplier and gradient methods
• Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• Alternating direction methods for classical and ptychographic phase retrieval
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• Nonlinear Difference Equations and Gauss-Seidel Type Iterative Methods
• Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
• Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
• 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
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization