An interior point algorithm for computing saddle points of constrained continuous minimax

An interior point algorithm for computing saddle points of constrained continuous minimax

0.00 Avg rating0 Votes
Article ID: iaor2002443
Country: Netherlands
Volume: 99
Issue: 1
Start Page Number: 59
End Page Number: 77
Publication Date: Dec 2000
Journal: Annals of Operations Research
Authors: , ,
Keywords: optimization
Abstract:

The aim of this paper is to present an algorithm for finding a saddle point to the constrained minimax problem. The initial problem is transformed into an equivalent equality constrained problem, and then the interior point approach is used. To satisfy the original inequality constraints a logarithmic barrier function is used and special care is given to step size parameter to keep the variables within permitted boundaries. Numerical results illustrating the method are given.

Reviews

Required fields are marked *. Your email address will not be published.