✦ LIBER ✦

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

✍ Scribed by H. Mansouri; M. Zangiabadi; M. Pirhaji

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 397 KB
Volume: 12
Category: Article
ISSN: 1468-1218
DOI: 10.1016/j.nonrwa.2010.06.039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 unified approach to interior point alg

A unified approach to interior point algorithms for linear complementarity problems: A summary

✍ Masakazu Kojima; Nimrod Megiddo; Toshihito Noma; Akiko Yoshise 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 515 KB

A class of polynomial interior-point alg

A class of polynomial interior-point algorithms for the Cartesian second-order cone linear complementarity problem

✍ G.Q. Wang; D.T. Zhu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 513 KB