An algorithm for minimax

DOI10.1007/BF01498333MaRDI QIDQ3980568zbMATH OpenOpenAlexFDO

Authors B. 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

augmented Lagrangian algorithmconvergence ratesminimax problem

Mathematics Subject Classification ID

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

Recommendations

• Method for the determination of the minimax
• Finding the minimax with the aid of a dynamic system
• A smooth method for the finite minimax problem
• Minmaxmin problems revisited

Cites work

• An extension of Sion's minimax theorem with an application to a method for constrained games
• scientific article; zbMATH DE number 3275106 (Why is no real title available?)
• scientific article; zbMATH DE number 3085353 (Why is no real title available?)
• Necessary conditions for min-max problems and algorithms by a relaxation procedure
• Problèmes de minimax via l'analyse convexe et les inégalités variationelles: Théorie et algorithmes

Cited in

(6)

• New minimax algorithm
• Finding a minimax with specified accuracy
• scientific article; zbMATH DE number 5951611 (Why is no real title available?)
• scientific article; zbMATH DE number 16320 (Why is no real title available?)
• Two iterative algorithms for finding minimax solutions
• Finding the minimax with the aid of a dynamic system

This page was built for publication: An algorithm for minimax

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980568)