On Generating Nonconvex Optimization Test Problems

  • Maria V. BarkovaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11548)


This paper addresses a technique for generating two types of nonconvex test problems. We study quadratic problems with d.c. inequality constraints and sum-of-ratios programs where both numerators and denominators are quadratic functions. Based on the idea of P. Calamai and L. Vicente, we propose the procedures for constructing nonconvex test problems with quadratic functions of any dimension, where global and local solutions are known. The implementation of the procedures does not require any complicated operations and solving auxiliary problems, except for elementary operations with matrices and vectors.


Nonconvex test problems Quadratic function Fractional program d.c. functions 


  1. 1.
    Calamai, P.H., Vicente, L.N., Judice, J.J.: A new technique for generating quadratic programming test problems. Math. Program. 61, 215–231 (1993)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Calamai, P., Vicente, L.: Generating quadratic bilevel programming test problems. ACM Trans. Math. Softw. 20, 103–119 (1994)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Floudas, C.A., Pardalos, P.M.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Boston (1999)CrossRefGoogle Scholar
  4. 4.
    Gantmacher, F.R.: The Theory of Matrices. Fizmatlit, Moscow (2010). (in Russian)Google Scholar
  5. 5.
    Gruzdeva, T.V., Strekalovskiy, A.S.: On solving the sum-of-ratios problem. Appl. Math. Comput. 318, 260–269 (2018)MathSciNetGoogle Scholar
  6. 6.
    Jong, Y.-C.: An efficient global optimization algorithm for nonlinear sum-of-ratios problem (2012).
  7. 7.
    Kalitkin, N.N.: Chislennye metody (Numerical Methods). Nauka, Moscow (1978). (in Russian)Google Scholar
  8. 8.
    Ma, B., Geng, L., Yin, J., Fan, L.: An effective algorithm for globally solving a class of linear fractional programming problem. J. Softw. 8(1), 118–125 (2013)CrossRefGoogle Scholar
  9. 9.
    Orlov, A.V., Malyshev, A.V.: Test problem generation for quadratic-linear pessimistic bilevel optimization. Numer. Anal. Appl. 7(3), 204–214 (2014)CrossRefGoogle Scholar
  10. 10.
    Pardalos, P.M.: Construction of test problems in quadratic bivalent programming. ACM Trans. Math. Softw. 17(1), 74–87 (1991)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Pardalos, P.M.: Generation of large-scale quadratic programs for use as global optimization test problems. ACM Trans. Math. Softw. 13(2), 133–137 (1987)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Strekalovsky, A.S.: Elements of Nonconvex Optimization. Nauka, Novosibirsk (2003). (in Russian)Google Scholar
  13. 13.
    Vicente, L.N., Calamai, P.H., Judice, J.J.: Generation of disjointly constrained bilinear programming test problems. Comput. Optim. Appl. 1(3), 299–306 (1992)MathSciNetCrossRefGoogle Scholar
  14. 14.

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Matrosov Institute for System Dynamics and Control Theory of SB of RASIrkutskRussia

Personalised recommendations