✦ LIBER ✦

An Interior-Point Algorithm for Nonlinear Minimax Problems

✍ Scribed by E. Obasanjo; G. Tzallas-Regas; B. Rustem

Publisher: Springer
Year: 2009
Tongue: English
Weight: 779 KB
Volume: 144
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-009-9599-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An interior proximal point algorithm for

An interior proximal point algorithm for nonlinear complementarity problems

✍ Abdellah Bnouhachem; Muhammad Aslam Noor 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 321 KB

In this paper, we propose a new method for solving nonlinear complementarity problems (NCP), where the underlying function F is pseudomonotone and continuous. The method can be viewed as an extension of the method of Noor and Bnouhachem (2006) [13], by performing an additional projection step at eac

A positive interior-point algorithm for

A positive interior-point algorithm for nonlinear complementarity problems

✍ Ma Chang-feng; Liang Guo-ping; Chen Xin-mei 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 375 KB

An infeasible-interior-point algorithm f

An infeasible-interior-point algorithm for linear complementarity problems

✍ Stephen J. Wright 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 919 KB

A hybrid algorithm for nonlinear minimax

A hybrid algorithm for nonlinear minimax problems

✍ Fusheng Wang; Kecun Zhang 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 471 KB

An interior points algorithm for the con

An interior points algorithm for the convex feasibility problem

✍ Ron Aharoni; Abraham Berman; Yair Censor 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Interior-point methods for nonlinear com

Interior-point methods for nonlinear complementarity problems

✍ F. A. Potra; Y. Ye 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 901 KB