Repository of convex quadratic programming problems

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 671-681

  Maros, István ^a   Mészáros, Csaba ^a,b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING;

TEST PROBLEMS;

QUADRATIC PROGRAMMING;

EID: 1642586652     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805768     Document Type: Article

References (9)

1. Bongartz, I., Conn, A. R., Gould, N. and Toint, Ph. L. (1995). CUTE: Constrained and unconstrained testing environment, ACM Transactions on Mathematical Software 21, 123-160.
2. Gay, D. M. (1985). Electronic mail distribution of linear programming test problems, Mathematical Programming Society COAL Newsletter, 13, 10-12.
3. Jones, H. and Mitra, G. (1997). Solution of the Convex Quadratic Programming Problem Using the Interior Point Method, TR/03/97 Department of Mathematics and Statistics. Brunel University, London.
4. MPSX User's Manual, IBM Corporation.
5. Mészáros, Cs. (1997). BPMPD User's Manual Version 2.20, Department of Computing, Imperial College.
6. Mészáros, Cs. (1998). The BPMPD interior point solver for convex quadratic problems, Working paper WP 98-8, Computer and Automation Institute, Budapest.
7. Murtagh, B. (1981). Advanced Linear Programming: Computation and Practice. McGraw-Hill.
8. OSL Optimization Subroutine Library, IBM Corporation, OSL Home Page, http://www.research.ibm.com/osl/.
9. Vanderbei, R. J. (1997). LOQO User's Manual, TR No. SOR-97-07, Statistics and Operations Research, Princeton University, New Jersey, USA.