Skip to main content

A Class of Smooth Modification of Space-Filling Curves for Global Optimization Problems

  • Conference paper
  • First Online:

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 197))

Abstract

This work presents a class of smooth modifications of space-filling curves applied to global optimization problems. These modifications make the approximations of the Peano curves (evolvents) differentiable in all points, and save the differentiability of the optimized function. To evaluate the proposed approach, some results of numerical experiments with the original and modified evolvents for solving global optimization problems are discussed.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Trn, A., Ilinskas, A.: Global Optimization. Lecture Notes in Computer Science 350. Springer, Heidelberg (1989)

    Google Scholar 

  2. Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Heidelberg (1990)

    Book  MATH  Google Scholar 

  3. Zhigljavsky, A.A.: Theory of Global Random Search. Kluwer Academic Publishers, Dordrecht (1991)

    Book  Google Scholar 

  4. Pintr, J.D.: Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications). Kluwer Academic Publishers, Dordrecht (1996)

    Book  Google Scholar 

  5. 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 

  6. Locatelli, M., Schoen, F.: Global optimization: theory, algorithms, and applications. SIAM (2013)

    Google Scholar 

  7. Floudas, C.A., Pardalos, M.P.: Recent Advances in Global Optimization. Princeton University Press, Princeton (2016)

    Google Scholar 

  8. Chendes, T. (ed.).: Development in Reliable Computing. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  9. Sergeyev, Y.D., Strongin, R.G., Lera, D.: Introduction to Global Optimization Exploiting Space-Filling Curves. Springer, Heidelberg (2013)

    Book  MATH  Google Scholar 

  10. Paulaviius, R., Ilinskas, A.: Simplicial Global Optimization. Springer Briefs in Optimization. Springer, New York (2014)

    Book  Google Scholar 

  11. Strongin, R.G.: Numerical Methods in Multi-extremal Problems (Information-Statistical Algorithms). Nauka, Moscow (1978). (in Russian)

    MATH  Google Scholar 

  12. Strongin, R.G., Gergel, V.P., Grishagin, V.A., Barkalov, K.A.: Parallel Computations for Global Optimization Problems. Moscow State University, Moscow (2013). (in Russian)

    Google Scholar 

  13. Barkalov, K.A., Gergel, V.P.: Multilevel scheme of dimensionality reduction for parallel global search algorithms. In: Proceedings of the 1st International Conference on Engineering and Applied Sciences Optimization, pp. 2111–2124 (2014)

    Google Scholar 

  14. Gergel, V., Grishagin, V., Israfilov, R.: Local tuning in nested scheme of global optimization. Procedia Comput. Sci. 51, 865–874 (2015)

    Article  Google Scholar 

  15. Gergel V.P., Grishagin V.A., Gergel A.V.: Adaptive nested optimization scheme for multidimensional global search. J. Glob. Optim., 1–17 (2015)

    Google Scholar 

  16. Gergel, V., Sidorov, S. .A: Two-level parallel global search algorithm for solution of computationally intensive multiextremal optimization problems. In: Malyshkin, V. (Ed.) PaCT 2015, LNCS, vol. 9251, pp. 505–515. Springer, Heidelberg (2015)

    Google Scholar 

  17. Lera, D., Sergeyev, Y.D.: Acceleration of univariate global optimization algorithms working with lipschitz functions and lipschitz first derivatives. SIAM J. Optim. 23(1), 508–529 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sergeyev, Y.D., Kvasov, D.E.: A deterministic global optimization using smooth diagonal auxiliary functions. Commun. Nonlinear Sci. Numer. Simul. 21(1–3), 99–111 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  19. 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 

  20. Breiman, L., Cutler, A.: A deterministic algorithm for global optimization. Math. Program. 58(1–3), 179–199 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  21. Gergel, V.P.: A method of using derivatives in the minimization of multiextremum functions. Comput. Math. Math. Phys. 36(6), 729–742 (1996)

    MathSciNet  MATH  Google Scholar 

  22. Sergeyev, Y.D.: Global one-dimensional optimization using smooth auxiliary functions. Math. Program. 81(1), 127–146 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  23. Grishagin, V.A.: Operating characteristics of some global search algorithms. Probl. Stoch. Search. 7, 198–206 (1978). (In Russian)

    MATH  Google Scholar 

Download references

Acknowledgements

This research was supported by the Russian Science Foundation, project No 16-11-10150 Novel efficient methods and software tools for time-consuming decision-making problems using supercomputers of superior performance.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexey Goryachih .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Goryachih, A. (2017). A Class of Smooth Modification of Space-Filling Curves for Global Optimization Problems . In: Kalyagin, V., Nikolaev, A., Pardalos, P., Prokopyev, O. (eds) Models, Algorithms, and Technologies for Network Analysis. NET 2016. Springer Proceedings in Mathematics & Statistics, vol 197. Springer, Cham. https://doi.org/10.1007/978-3-319-56829-4_5

Download citation

Publish with us

Policies and ethics