The rate of convergence of augmented Lagrangian method for minimax optimization problems with equality constraints

DOI10.1007/S40305-022-00439-ZMaRDI QIDQ6566775

Yu-Hong Dai, Liwei Zhang

Publication date: 3 July 2024

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

zbMATH Keywords

minimax optimizationrate of convergenceaugmented Lagrangian methodsecond-order sufficiency optimality

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
• Generalized inverses: theory and computations
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Definite and Semidefinite Quadratic Forms

Related Items (1)

Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems

This page was built for publication: The rate of convergence of augmented Lagrangian method for minimax optimization problems with equality constraints

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