A class of nonlinear Lagrangian algorithms for minimax problems
From MaRDI portal
Recommendations
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
- A nonlinear augmented Lagrangian for constrained minimax problems
- A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems
- A nonlinear Lagrangian for constrained optimization problems
Cited in
(11)- An efficient approach to nonlinear minimax problems
- An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems
- An ODE-based approach to nonlinearly constrained minimax problems
- A proximal-projection partial bundle method for convex constrained minimax problems
- Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- scientific article; zbMATH DE number 3886492 (Why is no real title available?)
- scientific article; zbMATH DE number 5670172 (Why is no real title available?)
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
- A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
- Parameter estimation in models generated by SDEs with symmetric alpha-stable noise
This page was built for publication: A class of nonlinear Lagrangian algorithms for minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950052)
