An Interior-Point Algorithm for Nonlinear Minimax Problems
- First Online:
- Cite this article as:
- Obasanjo, E., Tzallas-Regas, G. & Rustem, B. J Optim Theory Appl (2010) 144: 291. doi:10.1007/s10957-009-9599-z
- 177 Downloads
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.