Test problems for global nonconvex quadratic programming algorithms

Part of the Lecture Notes in Computer Science book series (LNCS, volume 268)


Test Problem Generate Test Problem Optimization Test Problem Global Optimization Test Bounded Polyhedron 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CROW78]
    Crowder, H., Dembo, R.S., and Mulvey, J.M. Reporting computational experiments in mathematical programming. Math. Progr. 15 (1978), 316–329.CrossRefGoogle Scholar
  2. [CROW79]
    Crowder, H., Dembo, R.S., and Mulvey, J.M. On reporting computational experiments with mathematical software. ACM Trans. on Mathem. Soft. 5 (1979), 193–203.CrossRefGoogle Scholar
  3. [KALA86]
    Kalantari, B. and Rosen, J.B. Construction of large-scale global minimum concave quadratic test problems. JOTA 48 (1986), 303–313.CrossRefGoogle Scholar
  4. [PARD86]
    Pardalos, P.M. On generating test problems for global optimization algorithms problem. Tech. Report CS-86-01, Comput Sci. Dept, Penn. State University.Google Scholar
  5. [PARD87]
    Pardalos, P.M. Generation of large-scale quadratic programs for use as global optimization test problems. To appear in ACM Trans. on Math. Software (1987).Google Scholar
  6. [SUNG82]
    Sung, Y.Y. and Rosen, J.B. Global minimum test problem construction. Math. Progr. 24 (1982), 353–355.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1987

Personalised recommendations