Skip to main content
SpringerLink
Log in

A Brief Conclusion

  • Chapter
  • First Online:
Introduction to Global Optimization Exploiting Space-Filling Curves

Part of the book series: SpringerBriefs in Optimization ((BRIEFSOPTI))

  • 1217 Accesses

Abstract

We conclude this brief book by emphasizing once again that it is just an introduction to the subject. We have considered the basic Lipschitz global optimization problem, i.e., global minimization of a multiextremal, non-differentiable Lipschitz function over a hyperinterval with a special emphasis on Peano curves, strategies for adaptive estimation of Lipschitz information, and acceleration of the search.

What we call the beginning is often the end. And to make an end is to make a beginning. The end is where we start from. T. S. Eliot

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. Casado, L.G., García, I., Martínez, J.A., Sergeyev, Ya.D.: New interval analysis support functions using gradient information in a global minimization algorithm. J. Global Optim. 25, 345–362 (2003)

    Google Scholar 

  2. Casado, L.G., García, I., Sergeyev, Ya.D.: Interval Branch and Bound global optimization for finding the first zero-crossing in one-dimensional functions. Reliable Comput. 6, 179–191 (2000)

    Google Scholar 

  3. Casado, L.G., García, I., Sergeyev, Ya.D.: Interval algorithms for finding the minimal root in a set of multiextremal non-differentiable one-dimensional functions. SIAM J. Sci. Comput. 24, 359–376 (2002)

    Google Scholar 

  4. Daponte, P., Grimaldi, D., Molinaro, A., Sergeyev, Ya.D.: An algorithm for finding the zero crossing of time signals with Lipschitzean derivatives. Measurement 16, 37–49 (1995)

    Article  Google Scholar 

  5. Daponte, P., Grimaldi, D., Molinaro, A., Sergeyev, Ya.D.: Fast detection of the first zero-crossing in a measurement signal set. Measurement 19, 29–39 (1996)

    Article  Google Scholar 

  6. Gergel, V.P.: A global search algorithm using derivatives. In: Systems Dynamics and Optimization, pp. 161–178. N.Novgorod University Press, N. Novgorod (1992) (In Russian)

    Google Scholar 

  7. Gergel, V.P., Sergeyev, Ya.D.: Sequential and parallel global optimization algorithms using derivatives. Comput. Math. Appl. 37, 163–180 (1999)

    Google Scholar 

  8. Kvasov, D.E., Sergeyev, Ya.D.: A univariate global search working with a set of Lipschitz constants for the first derivative. Optim. Lett. 3, 303–318 (2009)

    Google Scholar 

  9. Kvasov, D.E., Sergeyev, Ya.D.: Lipschitz gradients for global optimization in a one-point-based partitioning scheme. J. Comput. Appl. Math. 236, 4042–4054 (2012)

    Google Scholar 

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

    Google Scholar 

  11. Martínez, J.A., Casado, L.G., García, I., Sergeyev, Ya.D., G.-Tóth, B.: On an efficient use of gradient information for accelerating interval global optimization algorithms. Numer. Algorithm 37, 61–69 (2004)

    Article  MATH  Google Scholar 

  12. Molinaro, A., Pizzuti, C., Sergeyev, Ya.D.: Acceleration tools for diagonal information global optimization algorithms. Comput. Optim. Appl. 18, 5–26 (2001)

    Google Scholar 

  13. Sergeyev, Ya.D.: A method using local tuning for minimizing functions with Lipschitz derivatives. In: Bomze, E., Csendes, T., Horst, R., Pardalos, P.M. (eds.) Developments in Global Optimization, pp. 199–215. Kluwer, Dordrecht (1997)

    Google Scholar 

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

    Google Scholar 

  15. Sergeyev, Ya.D.: Parallel information algorithm with local tuning for solving multidimensional GO problems. J. Global Optim. 15, 157–167 (1999)

    Google Scholar 

  16. Sergeyev, Ya.D.: Multidimensional global optimization using the first derivatives. Comput. Math. Math. Phys. 39, 743–752 (1999)

    Google Scholar 

  17. Sergeyev Ya.D.: An efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms. J. Optim. Theor. Appl. 107, 145–168 (2000)

    Google Scholar 

  18. Sergeyev, Ya.D.: Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms. J. Optim. Theor. Appl. 124, 503–510 (2005)

    Google Scholar 

  19. Sergeyev, Ya.D.: Univariate global optimization with multiextremal nondifferentiable constraints without penalty functions. Comput. Optim. Appl. 34, 229–248 (2006)

    Google Scholar 

  20. Sergeyev, Ya.D., Grishagin, V.A.: Sequential and parallel algorithms for global optimization. Optim. Meth. Software 3, 111–124 (1994)

    Google Scholar 

  21. Sergeyev, Ya.D., Grishagin, V.A.: Parallel asynchronous global search and the nested optimization scheme. J. Comput. Anal. Appl. 3, 123–145 (2001)

    Google Scholar 

  22. Sergeyev, Ya.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16, 910–937 (2006)

    Google Scholar 

  23. Sergeyev, Ya.D., Kvasov, D.E.: Diagonal Global Optimization Methods. FizMatLit, Moscow (2008) (In Russian)

    Google Scholar 

  24. Sergeyev, Ya.D., Kvasov, D.E.: Lipschitz global optimization. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopaedia of Operations Research and Management Science, vol. 4, pp. 2812–2828. Wiley, New York (2011)

    Google Scholar 

  25. Sergeyev, Ya.D., Markin, D.L.: An algorithm for solving global optimization problems with nonlinear constraints. J. Global Optim. 7, 407–419 (1995)

    Google Scholar 

  26. Sergeyev, Ya.D., Strongin, R.G.: A global minimization algorithm with parallel iterations. Comput. Math. Math. Phys. 29, 7–15 (1990)

    Google Scholar 

  27. Sergeyev, Ya.D., Daponte, P., Grimaldi, D., Molinaro, A.: Two methods for solving optimization problems arising in electronic measurements and electrical engineering. SIAM J. Optim. 10, 1–21 (1999)

    Google Scholar 

  28. Sergeyev, Ya.D., Famularo, D., Pugliese, P.: Index Branch-and-Bound Algorithm for Lipschitz univariate global optimization with multiextremal constraints. J. Global Optim. 21, 317–341 (2001)

    Google Scholar 

  29. Sergeyev, Ya.D., Kvasov, D., Khalaf, F.M.H.: A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints. Optim. Lett. 1, 85–99 (2007)

    Google Scholar 

  30. Strongin, R.G.: Search for Global Optimum. Series of Mathematics and Cybernetics 2. Znanie, Moscow (1990) (In Russian)

    Google Scholar 

  31. Strongin, R.G., Markin, D.L.: Minimization of multiextremal functions with nonconvex constraints. Cybernetics 22, 486–493 (1986)

    Article  MATH  Google Scholar 

  32. Strongin, R.G., Sergeyev, Ya.D.: Global multidimensional optimization on parallel computer. Parallel Comput. 18, 1259–1273 (1992)

    Google Scholar 

  33. Strongin, R.G., Sergeyev, Ya.D.: Global Optimization with Non-convex Constraints: Sequential and Parallel Algorithms. Kluwer, Dordrecht (2000)

    Google Scholar 

  34. Strongin, R.G., Sergeyev, Ya.D.: Global optimization: fractal approach and non-redundant parallelism. J. Global Optim. 27, 25–50 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Modeling, Electronics and Systems, Università della Calabria, Rende, Italy

    Yaroslav D. Sergeyev

  2. Software Department, N.I. Lobachevsky University of Nizhni Novgorod, Nizhni Novgorod, Russia

    Roman G. Strongin

  3. Department of Mathematics and Computer Science, University of Cagliari, Cagliari, Italy

    Daniela Lera

Authors
  1. Yaroslav D. Sergeyev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman G. Strongin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniela Lera
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Yaroslav D. Sergeyev, Roman G. Strongin, Daniela Lera

About this chapter

Cite this chapter

Sergeyev, Y.D., Strongin, R.G., Lera, D. (2013). A Brief Conclusion. In: Introduction to Global Optimization Exploiting Space-Filling Curves. SpringerBriefs in Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8042-6_5

Download citation

Publish with us

Policies and ethics

Search

Navigation