✦ LIBER ✦

An O(n3L) primal interior point algorithm for convex quadratic programming

✍ Scribed by D. Goldfarb; S. Liu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n3L) primal—dual potential reductio

✍ Donald Goldfarb; Shucheng Liu 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 517 KB

Solving convex quadratic programming by

✍ Liang Xi-ming; Ma Long-hua; Qian Ji-xin 📂 Article 📅 2001 🏛 SP Zhejiang University Press 🌐 English ⚖ 354 KB

An O(n3L) potential reduction algorithm

✍ Yinyu Ye 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 754 KB

Primal-dual proximal point algorithm for

✍ Satoru Ibaraki; Masao Fukushima; Toshihide Ibaraki 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 964 KB

Long steps in an O(n3L) algorithm for li

✍ Kurt M. Anstreicher; Robert A. Bosch 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 844 KB

A globally convergent interior point alg

✍ Xiaona Fan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 393 KB