Publisher
Springer Science and Business Media LLC
Reference12 articles.
1. Nesterov, Y.E., Nemirovskii, A.S.: Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. SIAM Publications, Philadelphia (1993)
2. Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Opt. 15, 101–128 (2004). doi: 10.1137/S1052623403423114
3. Peng, J., Roos, C., Terlaky, T.: Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. 93(1), 129–171 (2002)
4. Roos, C.: A full-Newton step $${O}({n})$$ infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16, 1110–1136 (2006). doi: 10.1137/050623917
5. Liu, Z.Y., Chen, Y.: A full Newton step infeasible interior-point algorithm for linear programming based on a self-regular proximity. J. Appl. Math. Inform. 29(1–2), 119–133 (2011)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献