Steplength selection in interior-point methods for quadratic programming

Anstreicher, 1994, On the convergence of an infeasible primal–dual interior-point method for convex programming, Optim. Methods Softw., 3, 273, 10.1080/10556789408805570 J. Betts, S.K. Eldersveld, P.D. Frank, J.G. Lewis, An interior-point nonlinear programming algorithm for large scale optimization, Technical Report MCT TECH-003, Mathematics and Computing Technology, The Boeing Company, P.O. Box 3707, Seattle WA 98124-2207, 2000 Byrd, 1999, An interior point algorithm for large scale nonlinear programming, SIAM J. Optim., 9, 877, 10.1137/S1052623497325107 Carpenter, 1993, Higher-order predictor-corrector interior point methods with application to quadratic objectives, SIAM J. Optim., 3, 696, 10.1137/0803036 Dolan, 2002, Benchmarking optimization software with performance profiles, Math. Program., Ser. A, 91, 201, 10.1007/s101070100263 Maros, 1999, A repository of convex quadratic programming problems, Optim. Methods Softw., 11 & 12, 671, 10.1080/10556789908805768 Mehrotra, 1992, On the implementation of a primal–dual interior point method, SIAM J. Optim., 2, 575, 10.1137/0802028 Meszaros, 1999, Steplengths in infeasible primal–dual interior point methods for quadratic programming, Oper. Res. Lett., 213, 39, 10.1016/S0167-6377(99)00028-0 R.J. Vanderbei, LOQO: An interior point code for quadratic programming, Technical Report SOR 94-15, Program in Statistics and Operations, Research, Princeton University, New Jersey, USA, 1994 Vanderbei, 1999, An interior point algorithm for nonconvex nonlinear programming, Comput. Optim. Appl., 13, 231, 10.1023/A:1008677427361 Vanderbei, 2001 A. Wächter, L.T. Biegler, On the implementation of a primal–dual interior point filter line search algorithm for large-scale nonlinear programming, Technical Report RC 23149, IBM T.J. Watson Research Center, Yorktown Heights, NY, USA, March 2004 Wright, 1997