✦ LIBER ✦

Interior point algorithm for nonlinear complementarity problems

✍ Scribed by Min-Kyung Kim; Gyeong-Mi Cho

Book ID: 108076817
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 251 KB
Volume: 235
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.01.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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

Global convergence of a class of non-int

Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems

✍ Keisuke Hotta; Akiko Yoshise 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 195 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

A projected–gradient interior–point algo

A projected–gradient interior–point algorithm for complementarity problems

✍ Roberto Andreani; Joaquim J. Júdice; José Mario Martínez; Joao Patrício 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 473 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