A nonlinear augmented Lagrangian for constrained minimax problems
From MaRDI portal
Recommendations
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- The nonlinear and augmented Lagrangians for nonconvex optimization problems with a single constraint
- Augmented Lagrangian functions for constrained optimization problems
- On the convergence of augmented Lagrangian strategies for nonlinear programming
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- An alternating augmented Lagrangian method for constrained nonconvex optimization
- Nonlinear augmented Lagrangian for nonconvex multiobjective optimization
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
Cites work
- scientific article; zbMATH DE number 1158224 (Why is no real title available?)
- scientific article; zbMATH DE number 1399478 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- A smooth method for the finite minimax problem
- A smoothing trust-region Newton-CG method for minimax problem
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Convergence of a dual algorithm for minimax problems
- Enlarging the region of convergence of Newton's method for constrained optimization
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- Generalized monotone line search SQP algorithm for constrained minimax problems
- Nonmonotone line search algorithm for constrained minimax problems
- Optimization. Algorithms and consistent approximations
- Smooth Optimization Methods for Minimax Problems
Cited in
(19)- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- The optimality conditions for generalized minimax programming
- scientific article; zbMATH DE number 5670172 (Why is no real title available?)
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
- Substitution secant/finite difference method to large sparse minimax problems
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- A nonlinear Lagrange algorithm for stochastic minimax problems based on sample average approximation method
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
- A nonlinear Lagrangian for constrained optimization problems
- A nonmonotonic hybrid algorithm for min-max problem
- An active-set algorithm and a trust-region approach in constrained minimax problem
- An exact augmented Lagrangian function for nonlinear programming with two-sided con\-straints
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- The rate of convergence of augmented Lagrangian method for minimax optimization problems with equality constraints
- A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
- An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems
- A class of nonlinear Lagrangian algorithms for minimax problems
- A modified Lagrangian function algorithm for minimax problems with inequality constraints
- scientific article; zbMATH DE number 3963580 (Why is no real title available?)
This page was built for publication: A nonlinear augmented Lagrangian for constrained minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427029)
