An algorithm for minimax

DOI10.1007/BF01498333zbMath0743.90097OpenAlexW2036159384MaRDI QIDQ3980568

Bruce D.Craven

Publication date: 26 June 1992

Published in: ZOR - Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01498333

zbMATH Keywords

convergence ratesminimax problemaugmented Lagrangian algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35) Semi-infinite programming (90C34) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• An extension of Sion's minimax theorem with an application to a method for constrained games
• Problèmes de minimax via l'analyse convexe et les inégalités variationelles: Théorie et algorithmes
• Necessary conditions for min-max problems and algorithms by a relaxation procedure
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for minimax