Article ID: | iaor1992714 |
Country: | Germany |
Volume: | 35 |
Start Page Number: | 425 |
End Page Number: | 434 |
Publication Date: | Aug 1991 |
Journal: | Mathematical Methods of Operations Research (Heidelberg) |
Authors: | Craven B.D. |
An algorithm is proposed for computing an unconstrained minimax, based on differential equations with suitable stabilization terms. Methods for accelerating the convergence are discussed. For computing a constrained minimax, the augmented Lagrangian algorithm of Powell, Hestenes and Rockafellar is generalized to minimax, assuming the unconstrained minimax algorithm as a subroutine. An estimate of the convergence rate is obtained.