✦ LIBER ✦

Complexity of a Noninterior Path-Following Method for the Linear Complementarity Problem

✍ Scribed by J. Burke; S. Xu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The largest step path following algorith

✍ Clovis C. Gonzaga 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 1002 KB

An O(n3L) adaptive path following algori

✍ Shinji Mizuno; Michael J. Todd 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 365 KB

A polynomial path-following interior poi

✍ Tibor Illés; Marianna Nagy; Tamás Terlaky 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 199 KB

A non–interior predictor–corrector path

✍ Jim Burke; Song Xu 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 126 KB

Underlying paths in interior point metho

✍ Chee-Khian Sim; Gongyun Zhao 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 269 KB

On the solution and complexity of a gene

✍ J. J. Júdice; L. N. Vicente 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 398 KB