Starting-point strategies for an infeasible potential reduction method

Optimization Letters

Volumn 4, Issue 1, 2010, Pages 131-146

  D'Apuzzo, Marco ^a   De Simone, Valentina ^a   di Serafino, Daniela ^a  

^a SECOND UNIVERSITY OF NAPLES   (Italy)

Author keywords

Potential reduction; Quadratic programming; Starting point

Indexed keywords

BASIC IDEA; CONVERGENCE THEORY; CONVEX QUADRATIC PROGRAMMING; DUALITY GAP; INITIAL VALUES; NONNEGATIVE ENTRIES; NUMERICAL EXPERIMENTS; POTENTIAL REDUCTION;

OPTIMIZATION;

EID: 72249101306     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-009-0150-9     Document Type: Article

References (15)

1. Byrd R., Nocedal J., Waltz R.: KNITRO: an integrated package for nonlinear optimization. In: Di Pillo, G., Roma, M. Large-Scale Nonlinear Optimization, pp. 35-59. Springer, Berlin (2006).
2. Cafieri S., D'Apuzzo M., De Simone V., di Serafino D.: On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems. Comput. Optim. Appl. 38, 27-45 (2007).
3. Cafieri S., D'Apuzzo M., De Simone V., di Serafino D.: Stopping criteria for inner iterations in inexact Potential Reduction methods: a computational study. Comput. Optim. Appl. 36, 165-193 (2007).
4. Cafieri S., D'Apuzzo M., De Simone V., di Serafino D., Toraldo G.: Convergence analysis of an inexact potential reduction method for convex quadratic programming. J. Optim. Theory Appl. 135, 355-366 (2007).
5. Cafieri, S., D'Apuzzo, M., De Simone, V., di Serafino, D.: On the use of an approximate constraint preconditioner in a potential reduction algorithm for quadratic programming. In: Cutello, V., Fotia, G., Puccio, L. (eds.) Applied and Industrial Mathematics in Italy II, Series on Advances in Mathematics for Applied Sciences, vol. 75, pp. 220-230. World Scientific, Singapore (2007).
6. Cafieri S., D'Apuzzo M., Marino M., Mucherino A., Toraldo G.: Interior point solver for large-scale quadratic programming problems with bound constraints. J. Optim. Theory Appl. 129, 55-75 (2006).
7. D'Apuzzo, M., De Simone, V., di Serafino, D.: On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods. Comput. Optim. Appl. (2008). doi: 10. 1007/s10589-008-9226-1.
8. Dolan E. D., Moré J. J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201-213 (2002).
9. Gertz E. M., Nocedal J., Sartenaer A.: Starting-point strategy for nonlinear interior methods. Appl. Math. Lett. 17, 945-952 (2004).
10. Gould N. I. M., Orban D., Toint P. L.: CUTEr (and SifDec), a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373-394 (2003).
11. Gertz, E. M., Wright, S. J.: Object-oriented software for quadratic programming. ACM Trans. Math. Softw. 29, 58-81 (2003). See also http://www. cs. wisc. edu/~swright/ooqp/.
12. Mehrotra S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575-601 (1992).
13. Mizuno S., Kojima M., Todd M. J.: Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming. SIAM J. Optim. 5, 52-67 (1995).
14. Vanderbei R. J.: An interior point code for quadratic programming. Optim. Methods Softw. 1, 451-484 (1999).
15. Wright S. J.: Primal-dual interior-point methods. SIAM, Philadelphia (1997).