Cover Image

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	He, Xin, Huang, Nan-Jing, Xiao, Yi-Bin, Fang, Ya-Ping
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C25, 90C30, 65K05, 68W40, 65B99
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A first-order augmented Lagrangian method for constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2023)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
by: Tondji, Lionel, et al.
Published: (2025)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
by: Zhou, Bin, et al.
Published: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
by: Hu, Wei, et al.
Published: (2026)

Connections between convex optimization algorithms and subspace correction methods
by: Jiang, Boou, et al.
Published: (2025)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
by: Lara, Felipe, et al.
Published: (2024)

General Constrained Matrix Optimization
by: Garner, Casey, et al.
Published: (2024)

Spectrally Constrained Optimization
by: Garner, Casey, et al.
Published: (2023)

A first-order method for nonconvex-strongly-concave constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

Acceleration and restart for the randomized Bregman-Kaczmarz method
by: Tondji, Lionel, et al.
Published: (2023)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
by: Guidotti, Nicolas L., et al.
Published: (2023)

Worst-Case Learning under a Multi-fidelity Model
by: Foucart, Simon, et al.
Published: (2024)

An optimal lower bound for smooth convex functions
by: Florea, Mihai I., et al.
Published: (2024)

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
by: Bauschke, Heinz H., et al.
Published: (2025)

A preconditioned inexact infeasible quantum interior point method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

First-order penalty methods for bilevel optimization
by: Lu, Zhaosong, et al.
Published: (2023)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
by: Monteiro, Renato D. C., et al.
Published: (2024)

nlKrylov: A Unified Framework for Nonlinear GCR-type Krylov Subspace Methods
by: Werner, Tom, et al.
Published: (2025)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

Hybrid optimal control with mixed-integer Lagrangian methods
by: Nikitina, Viktoriya, et al.
Published: (2024)

Adaptive first-order methods with enhanced worst-case rates
by: Florea, Mihai I.
Published: (2024)

Restarts subject to approximate sharpness: A parameter-free and optimal scheme for first-order methods
by: Adcock, Ben, et al.
Published: (2023)

Time-integrated Optimal Transport: A Robust Minimax Framework
by: Nguyen, Thai P. D., et al.
Published: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)

Randomized subspace correction methods for convex optimization
by: Jiang, Boou, et al.
Published: (2025)

An Augmented Lagrangian Method for Training Recurrent Neural Networks
by: Wang, Yue, et al.
Published: (2024)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
by: De Marchi, Alberto
Published: (2024)

Solving bilevel optimization via sequential minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
by: Ras, Charl, et al.
Published: (2024)

Implicit augmented Lagrangian and generalized optimization
by: De Marchi, Alberto
Published: (2023)

Global Descent Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2025)

Some Remarks on the Optimal Level of Randomization in Global Optimization
by: Theodosopoulos, Ted
Published: (2004)

Progressive Power Homotopy for Non-convex Optimization
by: Xu, Chen
Published: (2026)