Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Calamai, P.H., Vicente, L.N., Judice, J.J.: A new technique for generating quadratic programming test problems. Math. Program. 61, 215–231 (1993)
Calamai, P., Vicente, L.: Generating quadratic bilevel programming test problems. ACM Trans. Math. Softw. 20, 103–119 (1994)
Floudas, C.A., Pardalos, P.M.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Boston (1999)
Gantmacher, F.R.: The Theory of Matrices. Fizmatlit, Moscow (2010). (in Russian)
Gruzdeva, T.V., Strekalovskiy, A.S.: On solving the sum-of-ratios problem. Appl. Math. Comput. 318, 260–269 (2018)
Jong, Y.-C.: An efficient global optimization algorithm for nonlinear sum-of-ratios problem (2012). http://www.optimization-online.org/DB_FILE/2012/08/3586.pdf
Kalitkin, N.N.: Chislennye metody (Numerical Methods). Nauka, Moscow (1978). (in Russian)
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)
Orlov, A.V., Malyshev, A.V.: Test problem generation for quadratic-linear pessimistic bilevel optimization. Numer. Anal. Appl. 7(3), 204–214 (2014)
Pardalos, P.M.: Construction of test problems in quadratic bivalent programming. ACM Trans. Math. Softw. 17(1), 74–87 (1991)
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)
Strekalovsky, A.S.: Elements of Nonconvex Optimization. Nauka, Novosibirsk (2003). (in Russian)
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)
The COCONUT Benchmark. https://www.mat.univie.ac.at/~neum/glopt/coconut/Benchmark/Benchmark.html. Accessed 21 Feb 2019
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Barkova, M.V. (2019). On Generating Nonconvex Optimization Test Problems. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2019. Lecture Notes in Computer Science(), vol 11548. Springer, Cham. https://doi.org/10.1007/978-3-030-22629-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-22629-9_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22628-2
Online ISBN: 978-3-030-22629-9
eBook Packages: Computer ScienceComputer Science (R0)