An Interior-Point algorithm for Nonlinear Minimax Problems
We 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.
When requesting a correction, please mention this item's handle: RePEc:com:wpaper:019. See general 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)The email address of this maintainer does not seem to be valid anymore. Please ask Anil Khuman to update the entry or send us the correct address
If references are entirely missing, you can add them using this form.