✦ LIBER ✦

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization

✍ Scribed by Bian, Wei; Chen, Xiaojun; Ye, Yinyu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Complexity Analysis for Interior-Point

✍ Ji, Jun; Yinyu, Ye 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 864 KB

On the Oracle Complexity of First-Order

✍ Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L. 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

Complexity analysis of interior-point al

✍ Zhong-gen Qian; Yan-qin Bai; Guo-qiang Wang 📂 Article 📅 2008 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 189 KB

Complexity analysis of an interior-point

✍ Peyghami, M. Reza; Hafshejani, S. Fathi 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 310 KB

Convergence Analysis of Inexact Infeasib

✍ Korzak, Janos 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 190 KB

Infeasible-interior-point algorithm for

✍ Shanglu He; Chengxian Xu 📂 Article 📅 2001 🏛 SP Science China Press 🌐 English ⚖ 328 KB