✦ LIBER ✦

An infeasible-interior-point algorithm for linear complementarity problems

✍ Scribed by Stephen J. Wright

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 919 KB
Volume: 67
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01582211

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A full-Newton step infeasible-interior-p

A full-Newton step infeasible-interior-point algorithm for linear complementarity problems

✍ H. Mansouri; M. Zangiabadi; M. Pirhaji 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 397 KB

An infeasible-interior-point potential-r

An infeasible-interior-point potential-reduction algorithm for linear programming

✍ Reha H. Tütüncü 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 156 KB

An interior point potential reduction al

An interior point potential reduction algorithm for the linear complementarity problem

✍ Masakazu Kojima; Nimrod Megiddo; Yinyu Ye 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 562 KB

Analysis of infeasible-interior-point pa

Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems

✍ Martin Preiß; Josef Stoer 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 221 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

On the analyticity properties of infeasi

On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems

✍ Josef Stoer; Martin Wechs 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 105 KB