A class of nonlinear Lagrangian algorithms for minimax problems

DOI10.3934/jimo.2013.9.75zbMath1263.90123OpenAlexW2330638866MaRDI QIDQ1950052

Yunyun Nie, Su-xiang He

Publication date: 24 May 2013

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2013.9.75

zbMATH Keywords

convergence analysisdual problemcontrolling parameternonlinear Lagrangian algorithmsunconstrained minimax problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35)

Related Items

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, An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems, Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved, A proximal-projection partial bundle method for convex constrained minimax problems