Linear convergence rate analysis of proximal generalized ADMM for convex composite programming

DOI10.1007/S11590-023-02063-ZMaRDI QIDQ6968959zbMATH OpenFDO

Authors Han Wang, Yunhai Xiao

Publication date 23 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-023-02063-Z

zbMATH Keywords

calmnessgeneralized ADMMlinear convergenceproximal parameters

Mathematics Subject Classification ID

Calculus of variations and optimal control; optimization (49-XX) Operations research, mathematical programming (90-XX)

Cites work

• A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
• A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
• A note on the convergence of ADMM for linearly constrained convex optimization problems
• A proximal point algorithm revisit on the alternating direction method of multipliers
• An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convergence analysis on a modified generalized alternating direction method of multipliers
• 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
• Hankel matrix rank minimization with applications to system identification and realization
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• Implicit Functions and Solution Mappings
• Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
• 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
• Parallel alternating direction multiplier decomposition of convex programs
• Some continuity properties of polyhedral multifunctions
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Variational Analysis

Cited in

(2)

• A three-block linearized generalized ADMM based iterative algorithm for separable convex programming with application to an image compression problem
• A majorized and generalized alternating direction method of multipliers for convex composite programming

This page was built for publication: Linear convergence rate analysis of proximal generalized ADMM for convex composite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968959)