An Interior-Point algorithm for Nonlinear Minimax Problems
AbstractWe present a primal-dual interior-point method for constrained nonlinear, discrete minimax problems where the objective functions and constraints are not necessarily convex. The algorithm uses two merit functions to ensure progress toward the points satisfying the first-order optimality conditions of the original problem. Convergence properties are described and numerical results provided.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by COMISEF in its series Working Papers with number 019.
Length: 40 pages
Date of creation: 06 Nov 2009
Date of revision:
Contact details of provider:
Web page: http://www.comisef.eu
Discrete min-max; Constrained nonlinear programming; Primal-dual interior-point methods; Stepsize strategies.;
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anil Khuman).
If references are entirely missing, you can add them using this form.