BPMPD interior point solver for convex quadratic problems

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 431-449

  Mészáros, Csaba ^a  

^a INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY;

CONVEX QUADRATIC PROBLEMS; INTERIOR POINT METHODS;

QUADRATIC PROGRAMMING;

EID: 1642618002     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805758     Document Type: Article

References (42)

1. Altman, A. and Gondzio, J. (1999). HOPDM's homepage. World Wide Web, http://www.maths.ed.ac.uk/gondzio/software/hopdm.html.
2. Andersen, E. D., Gondzio, J., Mészáros, Cs. and Xu, X. (1996). Implementation of interior point methods for large scale linear programs. In T. Terlaky editor, Interior point methods of mathematical programming, 189-252. Kluwer Academic Publishers.
3. Boyd. D. (1998). Calibrating and extrapolating weighted sample data sets by choosing new weights-an application of large-scale nonlinear programming. Applied Topics in Operations Research # 092-6940-02, Rensselaer Polytechnic Institute,
4. Brearley, A. L., Mitra, .G and Williams, H. P. (1975). Analysis of mathematical programming problems prior to applying the simplex algorithm, Math. Programming, 15: 54-83.
5. Carpenter, T. J., Lustig, I. J., Mulvey, J. M. and Shanno, D. F. (1993). Higher order predictor-corrector interior point methods with application to quadratic objectives, SIAM Journal on Optim., 3: 696-725.
6. Czyzyk, J., Mehrotra, S., Wagner, M. and Wright, S. (1999). PCx linear programming code. World Wide Web, http://www.mcs.anl.gov/otc/Tools/PCx/.
7. Dash Associates. DASH and XPRESS-MP. World Wide Web, http://www.dash.co.uk/, (1999).
8. Eisenstat, S. C., Gursky, M. C., Schultz, M. H. and Sherman, A. H. (1982). The Yale sparse matrix package, I. the symmetric code, Internat. J. Numer. Methods Engrg., 18: 1145-1151.
9. George, A. and Liu, J. W. H. (1981). Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ.
10. Gondzio, J. (1996). Multiple centrality corrections in a primal-dual method for linear programming, Computational Optimization and Applications, 6: 137-156.
11. IBM Co. The OSL Home Page. World Wide Web, http://www.research.ibm.com/osl/, (1999).
12. ILOG Inc. CPLEX Home Page - Mathematical Programming Software for Optimization. World Wide Web, http://www.cplex.com/, (1999).
13. Jansen, B., Roos, C., Terlaky, T. and Vial, J. P. (1996). Primal-dual target following algorithms for linear programming, Annals of Operations Research, 62: 197-231.
14. Karwan, M. H., Lotfi, V., Telgen, J. and Zionts, S. (1983). Redundancy in Mathematical Programming. Springer-Verlag.
15. Lobbrecht, A. H. (1997). Dymanic Water-System Control, Design and Operation of Regional Water-Resources Systems. PhD thesis, TU Delft, Department of Civil Engineering.
16. Lustig, I. J., Marsten, R. E. and Shanno, D. F. (1991). Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl., 20: 191-222.
17. Lustig, I. J., Marsten, R. E. and Shanno, D. F. (1994). Interior point methods for linear programming: Computational state of the art, ORSA Journal on Comput., 6(1), 1-15.
18. Maros, I. and Mészáros, Cs. (1997). A repository of convex quadratic programming problems. Technical Report DOC 97/6, Imperial College, Department of Computing, London. submitted to Optimization Methods and Software, the paper and the test problems are available from ftp://ftp.sztaki.hu/pub/oplab/QPDATA.
19. Maros, I. and Mészáros, Cs. (1998). The role of the augmented system in interior point methods. European Journal on Operational Research, 107(3), 720-736.
20. Mehrotra, S. (1992). On the implementation of a primal-dual interior point method, SIAM Journal on Optim., 2(4), 575-601.
21. Mészáros, Cs. (1993). On the modifications of the affine scaling algorithm for linear programming (Az affin skálázási algoritmus modosításairól), Alkalmazott Matematikai Lapok, (17), (in Hungarian).
22. Mézáros, Cs. (1996). Fast Cholesky factorization for interior point methods of linear programming, Computers & Mathematics with Applications, 31(4/5), 49-54.
23. Mészáros, Cs. (1997). BPMPD User's Manual, Version 2.20. Imperial College, Department of Computing, London, UK, August.
24. Mészáros, Cs. (1997). On free variables in interior point methods, Optimization Methods and Software, 9: 121-139.
25. Mészáros, Cs. (1997). Steplengths in infeasible primal-dual interior point algorithms of convex quadratic programming. Technical Report DOC 97/7, Imperial College, Department of Computing, London.
26. Mészáros, Cs. (1997). The augmented system variant of IPMs in two-stage stochastic linear programming, European Journal on Operational Research, 101(2), 317-327.
27. Mészáros, Cs. (1998). On a property of the Cholesky factorization and its consequences in interior point methods. Working paper WP 98-7, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest.
28. Mészáros, Cs. (1998). On the sparsity issues of interior point methods for quadratic programming. Working paper WP 98-4, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest.
29. Mészáros, Cs. (1998). Ordering heuristics in interior point LP methods. In F. Gianessi S. Komlósi and T. Rapcsák editors, New trends in mathematical programming, 203-221. Kluwer Academic Publishers.
30. Mittelmann, H. D. and Spellucci, P. (1998). Decision tree for optimization software. World Wide Web, http://plato.la.asu.edu/guide.html.
31. Monteiro, R. D. C. and Adler, I. (1989). Interior path following primal-dual algorithms. Part II: Convex quadratic programming, Math. Programming, 44: 43-66.
32. Monteiro, R. D. C. and Zhou, F. (1997). On superlinear convergence of infeasible-interior-point algorithms for linearly constrained convex programs. Computational Optimization and Applications, (8), 245-262.
33. Nazareth, J. L. (1987). Computer Solution of Linear Programs. Oxford University Press, New York.
34. Orchard-Hays, W. (1968). Advanced Linear Programming Computing Techniques. McGraw Hill.
35. Roos, C., Terlaky, T. and Vial, J. -Ph. (1996). Theory and Algorithms for Linear Optimization: An Interior Point Approach. John Wiley & Sons.
36. Stewart, G. W. (1989). On scaled projections and pseudoinverses, Linear Algebra Appl., 112: 189-193.
37. Vanderbei, R. J. (1995). Symmetric quasi-definite matrices, SIAM Journal on Optim., 5(1), 100-113 February.
38. Vanderbei, R. J. (1999). LOQO executables. World Wide Web, http://www.princeton.edu/rvdb/loqoexecs.html.
39. Vanderbei, R. J. and Carpenter, T. J. (1993). Symmetric indefinite systems for interior point methods. Math. Programming, 58: 1-32.
40. Wright, S. J. (1996). Modified Cholesky factorization in interior-point algorithms for linear programming. Technical Report P600-0596, Mathematics and Computer Science Division, Argonne National Laboratory.
41. Wright, S. J. (1997). Primal-dual interior point methods. SIAM, T57.74.W75, University Science Center, Philadelphia.
42. Zhang, J. (1999). Linear-programming Interior Point SOLvers. World Wide Web, http://www.caam.rice.edu/zhang/lipsol/.