Convergence analysis of an inexact potential reduction method for convex quadratic programming

Journal of Optimization Theory and Applications

Volumn 135, Issue 3, 2007, Pages 355-366

  Cafieri, S ^a   D'Apuzzo, M ^a   De Simone, V ^a   Di Serafino, D ^a   Toraldo, G ^b  

^a SECOND UNIVERSITY OF NAPLES   (Italy)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Global convergence; Inexact search directions; Potential reduction methods; Quadratic programming

Indexed keywords

COMPUTATIONAL EFFICIENCY;

CONVERGENCE ANALYSIS; CONVEX QUADRATIC PROGRAMMING; DUALITY GAP; GLOBAL CONVER-GENCE; INEXACT SEARCH DIRECTION; POTENTIAL REDUCTION; POTENTIAL REDUCTION METHOD; QUADRATIC PROGRAMMING PROBLEMS; REDUCTION METHOD; STOPPING CRITERION;

QUADRATIC PROGRAMMING;

EID: 36148974354     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-007-9264-3     Document Type: Article

References (12)

1. Benzi, M., Golub, G., Liesen, J.: Numerical solution of saddle point problems. Acta Numer. 14, 1-137 (2005)
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., Special Issue on High Performance Algorithms and Software for Nonlinear Optimization, Edited by A. Murli and G. Toraldo, doi: 10.1007/s10589-007-9035-y (2007)
3. Baryamureeba, V., Steihaug, T.: On the convergence of an inexact primal-dual interior-point method for linear programming. Report No. 188, Department of Informatics, University of Bergen, Bergen, Norway (2000)
4. Korzak, J.: Convergence analysis of inexact infeasible-interior-point- algorithms for solving linear programming problems. SIAM J. Optim. 11, 133-148 (2000)
5. Portugal, L., Resende, M., Veiga, G., Judice, J.: A truncated primal-infeasible dual-feasible interior point network flow method. Networks 35, 91-108 (2000)
6. 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)
7. 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., Special Issue on Linear Algebra Issues Arising in Interior Point Methods, Edited by J. Gondzio and G. Toraldo 36(2-3), 165-193 (2007)
8. Tanabe, K.: Centered newton method for mathematical programming. In: Iri, M., Yajima, K. (eds.) System Modeling and Optimization: Proceedings of the 13th IFIP Conference. Lecture Notes in Control and Information Systems, vol. 113, pp. 197-206. Springer, Berlin (1988)
9. Todd, M.J., Ye, Y.: A centered projective algorithm for linear programming. Math. Oper. Res. 15, 508-529 (1990)
10. Todd, M.J.: Potential-reduction methods in mathematical programming. Math. Program. 76, 3-45 (1996)
11. Kojima, M., Mizuno, S., Yoshise, A.: An L iteration potential-reduction algorithm for linear complementarity problems. Math. Program. 50, 331-342 (1991)
12. 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(1), 55-75 (2006)