The Bpmpd interior point solver for convex quadratically constrained quadratic programming problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5910 LNCS, Issue , 2010, Pages 813-820

  Mészáros, Csaba ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; CONSTRAINED QUADRATIC PROGRAMMING; INTERIOR POINT; PRIMAL DUAL ALGORITHMS; QUADRATIC PROBLEM; STABILITY ISSUES;

QUADRATIC PROGRAMMING;

EID: 77953755191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12535-5_97     Document Type: Conference Paper

References (14)

1. Andersen, E., Gondzio, J., Ḿesźaros, C., Xu, X.: Implementation of interior point methods for large scale linear programs. In: Terlaky, T. (ed.) Interior Point Methods of Mathematical Programming, pp. 189-252. Kluwer Academic Publishers, Dordrecht (1996)
2. George, A., Liu, J.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs (1981)
3. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1), 359-392 (1999)
4. Kojima, M., Megiddo, N., Mizuno, S.: Theoretical convergence of large-step primaldual interor-point algorithms for linear programming. Mathematical Programming 59(1) (1993)
5. Lustig, I., Marsten, R., Shanno, D.: Computational experience with a primal-dual interior point method for linear programming. Linear Algebra Appl. 20, 191-222 (1991)
6. Ḿesźaros, C.: The BPMPD interior-point solver for convex quadratic problems. Optimization Methods and Software 11-12, 431-449 (1999)
7. Ḿesźaros, C.: On the performance of the Cholesky factorization in interior point methods on Pentium 4 processors. CEJOR 13(4), 289-298 (2005)
8. Ḿesźaros, C.: On numerical issues of interior point methods. SIAM J. on Matrix Analysis 30(1), 223-235 (2008)
9. Ḿesźaros, C.: On the Cholesky factorization in interior point methods. Computers & Mathematics with Applications 50, 1157-1166 (2005)
10. Ḿesźaros, C.: Fast Cholesky factorization for interior point methods of linear programming. Computers & Mathematics with Applications 31(4/5), 49-54 (1996)
11. Mittelmann, H., Spellucci, P.: Decision tree for optimization software. World Wide Web (1998), http://plato.la.asu.edu/guide.html
12. Rothberg, E., Gupta, A.: Efficient Sparse Matrix Factorization on High-Performance Workstations-Exploiting the Memory Hierarchy. ACM Trans. Mathematical Software 17(3), 313-334 (1991)
13. Vanderbei, R.: Symmetric quasi-definite matrices. SIAM J. on Optimization 5(1), 100-113 (1995)
14. Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods 2, 77-79 (1981)