✦ LIBER ✦

A polynomial path-following interior point algorithm for general linear complementarity problems

✍ Scribed by Tibor Illés; Marianna Nagy; Tamás Terlaky

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 199 KB
Volume: 47
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-008-9348-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 non–interior predictor–corrector path

A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem

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

A new large-update interior point algori

A new large-update interior point algorithm for linear complementarity problems

✍ Gyeong-Mi Cho 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 190 KB

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

Complexity of large-update interior poin

Complexity of large-update interior point algorithm for linear complementarity problems

✍ G.M. Cho; M.K. Kim; Y.H. Lee 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 274 KB

In this paper we propose a new large-update primal-dual interior point algorithm for P \* (κ) linear complementarity problems (LCPs). We extend Bai et al.'s primal-dual interior point algorithm for linear optimization (LO) problems to P \* (κ) LCPs with generalized kernel functions. New search direc

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