Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Akrotirianakis, I., Rustem, B.: Globally convergent interior-point algorithm for nonlinear programming. J. Optim. Theory Appl. 125(3), 497–521 (2005)
2. Bakhtiari, S., Tits, A.L.: A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent. Comput. Optim. Appl. 25, 17–38 (2003)
3. Dhara, A., Dutta, J.: Optimality Conditions in Convex Optimization: A finite-Dimensional View. CRC Press, Boca Raton (2012)
4. Di Pillo, G., Lucidi, S., Palagi, L.: A truncated Newton method for constrained optimization. In: Di Pillo, G., Giannessi, F. (eds.) Nonlinear Optimization and Related Topics. Kluwer Academic, Dordrecht (2000)
5. Griva, I., Shanno, D.F., Vanderbei, R.J., Benson, H.Y.: Global convergence of a primal-dual interior point method for nonlinear programming. Algorithmic Oper. Res. 3, 12–29 (2008)