LOQO: An interior point code for quadratic programming

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 451-484

  Vanderbei, Robert J ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE;

PRIMAL-DUAL INTERIOR-POINT METHODS; SOFTWARE PACKAGE LOQO;

QUADRATIC PROGRAMMING;

EID: 0033293912     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805759     Document Type: Article

References (39)

1. Andersen, E. D., Gondzio, J., Mészáros, Cs. and Xu X. (1996). Implementation of interior-point methods for large scale linear programming. In T. Terlaky, editor, Interior point methods of mathematical programming, pages 189-252. Kluwer Academic Publishers, Dordrecht and Boston.
2. Boggs, P. T., Domich, P. D., Rogers, J. E., and Witzgall, C., (1991). An interior-point method for linear and quadratic programming problems. Technical Report NISTIR-4556, National Institute of Standards and Technology.
3. Breitfeld, M. G., and Shanno, D. F., (1994). Preliminary computational experience with modified log-barrier functions for large-scale nonlinear programming. In Hager, W. W. Hearn, D. W., and Pardalos, P. M., editors, Large scale optimization: state of the art, pages 45-66. Kluwer Academic Publishers.
4. Conn, A. R., Gould, N., and Toint, Ph. L., Constrained and unconstrained testing environment. http://www.dci.clrc.ac.uk/Activity.asp?CUTE.
5. Fourer, R., and Mehrotra, S., (1991). Solving symmetric indefinite systems in an interior point method for linear programming. Mathematical Programming, 62, 15-40.
6. Gay, D. M., (1985). Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newslettter, 13, 10-12.
7. George A., and Liu J. W. H., (1989). The evolution of the minimum degree ordering algorithm. SIAM Review, 31, 1-19.
8. Gill, P. E., Murray, W., Ponceleón, D. B., and Saunders, M. A., Primal-dual methods in linear programming. Technical Report SOL 91-3, Systems Optimization Laboratory, Stanford University, Stanford, CA, April 1991.
9. Gill, P. E., Murray, W., Ponceleón, D. B., and Saunders, M. A., (1991). Solving reduced KKT systems in barrier methods for linear and quadratic programming. Technical Report SOL 91-7, Systems Optimization Laboratory, Stanford University, Stanford, CA, July.
10. Gill, P. E., Murray, W., Ponceleón, D. B., and Saunders, M. A., (1992). Preconditioners for indefinite systems arising in optimization. SIAM Journal on Matrix Analysis and Applications, 13(1), 292-311.
11. Kojima, M., Megiddo, N. and Mizuno, S., (1993). A primal-dual infeasible-interior-point algorithm for linear programming. Mathematical Programming, 61, 263-400.
12. Lustig, I. J., (1990). Feasibility issues in a primal-dual interior-point method for linear programming. Mathematical Programming, 49(2), 145-162.
13. Lustig, I. J., Marsten, R. E., and Shanno, D. F., (1991). Computational experience with a primal-dual interior point method for linear programming. Lin. Alg. and Appl., 152, 191-222.
14. Lustig, I. J., Marsten, R. E., and Shanno, D. F., (1992). On implementing Mehrotra's predictor-corrector interior point method for linear programming. SIAM Journal on Optimization, 2, 435-449.
15. Lustig, I. J., Marsten, R. E., and Shanno, D. F., (1994). Interior point methods for linear programming: computational state of the art. ORSA J. on Computing, 6, 1-14.
16. Maros, I., and Mészáros, Cs., (1997). A repository of convex quadratic programming problems. Technical Report DOC 97/6, Imperial College, London, UK, Department of Computing, Imperial College, London, UK.
17. Megiddo, N., (1989). Pathways to the optimal set in linear programming. In Megiddo, N. editor, Progress in Mathematical Programming, pages 131-158, New York, Springer-Verlag.
18. Mehrotra, S., (1992). On the implementation of a (primal-dual) interior point method. SIAM Journal on Optimization, 2, 575-601.
19. Mészáros, Cs., (1998). On the sparsity issues of interior point methods for quadratic programming. Technical Report WP 98-4, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest.
20. Monteiro, R. D. C., and Adler, I., (1989). Interior path following primal-dual algorithms, part ii: Convex quadratic programming. Mathematical Programming, 44, 43-66.
21. 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.
22. Pissanetzky, S., (1984). Sparse Matrix Technology. Academic Press.
23. Potra, F. A., (1994). A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Mathematical Programming, 67, 383-406.
24. Rogers, J. E., Boggs, P. T., and Domich, P. D., (1994). A predictor-corrector-O3D formulation for quadratic programming. Technical report, National Institute of Standards and Technology.
25. Shanno, D. F., and Simantiraki, E. M., (1997). Interior-point methods for linear and nonlinear programming. In Duff, I. S., and Watson, G.A., editors, The State of the Art in Numerical Analysis, pages 339-362. Oxford University Press, New York.
26. Tanabe, K., (1989). Centered newton method for linear programming: exterior point method (in Japanese). In Proc. Inst. Stat. Mathematics, volume 37, pages 146-148.
27. Turner, K., (1991). Computing projections for the Karmarkar algorithm. Linear Algebra and Its Applications, 152, 141-154.
28. Vanderbei, R. J., (1989). Affine scaling and linear programs with free variables. Mathematical Programming, 39, 31-44.
29. Vanderbei, R. J., (1990). An implementation of the minimum-degree algorithm using simple data structures. Technical report, AT&T Bell Laboratories.
30. Vanderbei, R. J., (1994). Interior-point methods: algorithms and formulations. ORSA J. on Computing, 6, 32-34.
31. Vanderbei, R. J., LOQO: An interior point code for quadratic programming. Technical Report SOR 94-15, Princeton University, 1994. Revised 11/30/98. To appear in Optimization Methods and Software.
32. Vanderbei, R. J., (1995). Symmetric quasi-definite matrices. SIAM Journal on Optimization, 5(1), 100-113.
33. Vanderbei, R. J., (1997). Linear Programming: Foundations and Extensions. Kluwer Academic Publishers.
34. Vanderbei, R. J., and Carpenter, T. J., (1993). Symmetric indefinite systems for interior-point methods. Mathematical Programming, 58, 1-32.
35. Vanderbei, R. J., Duarte, A., and Yang, B., (1994). An algorithmic and numerical comparison of several interior-point methods. Technical Report SOR 94-05, Princeton University.
36. Vanderbei, R. J., and Shanno, D. F., (1999). An interior-point algorithm for nonconvex nonlinear programming. Computational Optimization and Applications, 13, 231-252.
37. Wright, S. J., (1994). An infeasible-interior-point algorithm for linear complementarity problems. Mathematical Programming, 67, 29-52.
38. Wright, S. J., (1996). Primal-Dual Interior-Point Methods. SIAM, Philadelphia, USA.
39. Zhang, Y., (1994). On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem. SIAM J. on Optimization, 4, 208-227.