In this paper we study a class of constrained minimax problems. In particular, we propose a
first-order augmented Lagrangian method for solving them, whose subproblems turn out to …

The augmented Lagrangian function and the corresponding augmented Lagrangian method
are constructed for solving a class of minimax optimization problems with equality …

A note on ‘new algorithms for constrained minimax optimization’ Page 1
Mathematical Programming 15 (1978) 239-242. North-Holland Publishing Company …

In this paper we introduce a new exact augmented Lagrangian function for the solution of
general nonlinear programming problems. For this Lagrangian function a complete …

This paper studies a class of nonlinear Lagrangian algorithms for solving unconstrained
minimax problems, which will provide an approach to constructing a concrete and novel …

This article presents a novel nonlinear Lagrange algorithm for solving minimax optimization
problems with both inequality and equality constraints, which eliminates the nonsmoothness …

In this paper we study the worst-case complexity of an inexact augmented Lagrangian
method for nonconvex constrained problems. Assuming that the penalty parameters are …

We consider the well-known augmented Lagrangian method for constrained optimization
and compare its classical variant to a modified counterpart which uses safeguarded …

We present an algorithm for nonlinear minimax optimization subject to linear equality and
inequality constraints which requires first order partial derivatives. The algorithm is based on …

This paper is aimed toward the definition of a new exact augmented Lagrangian function for
two-sided inequality constrained problems. The distinguishing feature of this augmented …