Skip to main content

An Approach for Generating Test Problems of Constrained Global Optimization

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10556))

Included in the following conference series:

Abstract

In the present paper, a novel approach to the constructing of the test global optimization problems with non-convex constraints is considered. The proposed approach is featured by a capability to construct the sets of such problems for carrying out multiple computational experiments in order to obtain a reliable evaluation of the efficiency of the optimization algorithms. When generating the test problems, the necessary number of constraints and desired fraction of the feasible domain relative to the whole global search domain can be specified. The locations of the global minimizers in the generated problems are known a priori that simplifies the evaluation of the results of the computational experiments essentially. A demonstration of the developed approach in the application to well-known index method for solving complex multiextremal optimization problems with non-convex constraints is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Famularo, D., Pugliese, P., Sergeyev, Y.D.: A global optimization technique for checking parametric robustness. Automatica 35, 1605–1611 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kvasov, D.E., Menniti, D., Pinnarelli, A., Sergeyev, Y.D., Sorrentino, N.: Tuning fuzzy power-system stabilizers in multi-machine systems by global optimization algorithms based on efficient domain partitions. Electr. Power Syst. Res. 78(7), 1217–1229 (2008)

    Article  Google Scholar 

  3. Kvasov, D.E., Sergeyev, Y.D.: Deterministic approaches for solving practical black-box global optimization problems. Adv. Eng. Softw. 80, 58–66 (2015)

    Article  Google Scholar 

  4. Modorskii, V.Y., Gaynutdinova, D.F., Gergel, V.P., Barkalov, K.A.: Optimization in design of scientific products for purposes of cavitation problems. Solving global optimization problems on GPU cluster. In: Simos, T.E. (ed.) ICNAAM 2015, AIP Conference Proceedings, 1738, art. no. 400013 (2016)

    Google Scholar 

  5. Floudas, C.A., et al.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Dordrecht (1999)

    Book  MATH  Google Scholar 

  6. Gaviano, M., Kvasov, D.E., Lera, D., Sergeyev, Y.D.: Software for generation of classes of test functions with known local and global minima for global optimization. ACM TOMS 29(4), 469–480 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Glob. Optim. 31(4), 635–672 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Addis, B., Locatelli, M.: A new class of test functions for global optimization. J. Glob. Optim. 38(3), 479–501 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Grishagin, V.A.: Operating characteristics of some global search algorithms. Probl. Stat. Optim. 7, 198–206 (1978). [in Russian]

    MATH  Google Scholar 

  10. Gergel, V., Grishagin, V., Gergel, A.: Adaptive nested optimization scheme for multidimensional global search. J. Glob. Optim. 66(1), 35–51 (2016)

    Article  MATH  MathSciNet  Google Scholar 

  11. Strongin, R.G., Sergeyev, Y.D.: Global Optimization with Non-Convex Constraints. Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht (2000)

    Book  MATH  Google Scholar 

  12. Sergeyev, Y.D., Famularo, D., Pugliese, P.: Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints. J. Glob. Optim. 21(3), 317–341 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Barkalov, K.A., Strongin, R.G.: A global optimization technique with an adaptive order of checking for constraints. Comput. Math. Math. Phys. 42(9), 1289–1300 (2002)

    MATH  MathSciNet  Google Scholar 

  14. Barkalov, K., Gergel, V., Lebedev, I.: Use of Xeon Phi coprocessor for solving global optimization problems. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 307–318. Springer, Cham (2015). doi:10.1007/978-3-319-21909-7_31

    Chapter  Google Scholar 

  15. Barkalov, K., Gergel, V.: Parallel global optimization on GPU. J. Glob. Optim. 66(1), 3–20 (2016)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

This study was supported by the Russian Science Foundation, project No 16-11-10150.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Victor Gergel .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gergel, V. (2017). An Approach for Generating Test Problems of Constrained Global Optimization. In: Battiti, R., Kvasov, D., Sergeyev, Y. (eds) Learning and Intelligent Optimization. LION 2017. Lecture Notes in Computer Science(), vol 10556. Springer, Cham. https://doi.org/10.1007/978-3-319-69404-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69404-7_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69403-0

  • Online ISBN: 978-3-319-69404-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics