✦ LIBER ✦

Interior-Point Polynomial Algorithms in Convex Programming || Appendix 2

✍ Scribed by Nesterov, Yurii; Nemirovskii, Arkadii

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interior-Point Polynomial Algorithms in

✍ Nesterov, Yurii; Nemirovskii, Arkadii 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics ⚖ 126 KB

Interior-Point Polynomial Algorithms in

✍ Nesterov, Yurii; Nemirovskii, Arkadii 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics ⚖ 280 KB

A polynomial arc-search interior-point a

✍ Yaguang Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 498 KB

A POLYNOMIAL PREDICTOR-CORRECTOR INTERIO

✍ Qian Yu; Chongchao Huang; Yan Jiang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Polynomiality of infeasible-interior-poi

✍ Shinji Mizuno 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 552 KB

Solving convex quadratic programming by

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