An inexact linearized augmented Lagrangian method for the linearly composite convex programming

DOI10.1142/S0217595925500174MaRDI QIDQ6851762zbMATH OpenFDO

Authors Tingting Zhu, Ya Ping Fang

Publication date 26 February 2026

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595925500174

zbMATH Keywords

convergence ratecustomized linearized augmented Lagrangian methodinexact linearized augmented Lagrangian methodlinear equality constrained composite convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Cites work

• A class of customized proximal point algorithms for linearly constrained convex optimization
• A customized proximal point algorithm for convex minimization with linear constraints
• A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
• A unified primal-dual algorithm framework based on Bregman iteration
• Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis
• Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
• Accelerated optimization for machine learning. First-order algorithms. With forewords by Michael I. Jordan, Zongben Xu and Zhi-Quan Luo
• Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
• Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
• scientific article; zbMATH DE number 3309655 (Why is no real title available?)
• Iteration-complexity of first-order augmented Lagrangian methods for convex programming
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Multiplier and gradient methods
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
• On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
• Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems

This page was built for publication: An inexact linearized augmented Lagrangian method for the linearly composite convex programming

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