Skip to main content
SpringerLink
Log in

Introduction

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

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

  • 1257 Accesses

Abstract

In this chapter, we give just a fast tour in the history of the subject, provide examples of space-filling curves, discuss some of their interesting (at least for us) properties (in this section), and introduce global optimization problems that will be considered in this book (see Sect.1.2). All technical considerations related to the details of the construction of space-filling curves, their usage in global optimization, numerical algorithms, etc. will be moved to the subsequent chapters.

Everyone knows what a curve is, until he has studied enough mathematics to become confused through the countless number of possible exceptions. Felix Kleins

Felix Kleins

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. Addis, B., Locatelli, M., Schoen, F.: Local optima smoothing for global optimization. Optim. Meth. Software 20, 417–437 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aguiar e Oliveira, H., Jr., Ingber, L., Petraglia, A., Rembold Petraglia, M., Augusta Soares Machado, M.: Stochastic Global Optimization and Its Applications with Fuzzy Adaptive Simulated Annealing. Springer, Berlin (2012)

    Google Scholar 

  3. Bomze, I.M., Csendes, T., Horst, R., Pardalos, P.M.: Developments in Global Optimization. Kluwer, Dordrecht (1997)

    Book  MATH  Google Scholar 

  4. Butz, A.R.: Space filling curves and mathematical programming. Inform. Contr. 12, 313–330 (1968)

    Article  MathSciNet  Google Scholar 

  5. Calvin, J., Žilinskas, A.: One-dimensional global optimization for observations with noise. Comput. Math. Appl. 50, 157–169 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cantor, G.: Ein Beitrag zur Mannigfaltigkeitslehre. Journal für die reine und angewandte Mathematik (Crelle’s Journal) 84, 242–258 (1878)

    Google Scholar 

  7. Carotenuto, L., Pugliese, P., Sergeyev, Ya.D.: Maximizing performance and robustness of PI and PID controllers by global optimization. Int. J. Contr. Intell. Syst. 34, 225–235 (2006)

    Google Scholar 

  8. Carter, R.G., Gablonsky, J.M., Patrick, A., Kelley, C.T., Eslinger, O.J.: Algorithms for noisy problems in gas transmission pipeline optimization. Optim. Eng. 2, 139–157 (2001)

    Article  MathSciNet  MATH  Google Scholar 

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

  10. Clausen, J., Žilinskas, A.: Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. Comput. Math. Appl. 44, 943–955 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

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

  13. Devaney, R.L.: An Introduction to Chaotic Dynamical Systems. Westview Press Inc, New York (2003)

    MATH  Google Scholar 

  14. Dixon, L.C.W., Szegö, G.P. (eds.): Towards Global Optimization, vol. 2. North-Holland, Amsterdam (1978)

    Google Scholar 

  15. Evtushenko, Yu. G.: Numerical methods for finding global extrema of a nonuniform mesh. USSR Comput. Math. Math. Phys. 11, 1390–1403 (1971)

    Article  MATH  Google Scholar 

  16. Evtushenko, Yu. G.: Numerical Optimization Techniques. Translation Series in Mathematics and Engineering. Optimization Software Inc., Publication Division, New York (1985)

    Book  Google Scholar 

  17. Evtushenko, Yu. G., Posypkin, M.A.: An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems. Comput. Math. Math. Phys. 51, 1286–1298 (2011)

    Article  MathSciNet  Google Scholar 

  18. Falconer, K.: Fractal Geometry: Mathematical Foundations and Applications. Wiley, Chichester (1995)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Famularo, D., Pugliese, P., Sergeyev, Ya.D.: A global optimization technique for fixed-order control design. Int. J. Syst. Sci. 35, 425–434 (2004)

    Google Scholar 

  21. Floudas, C.A.: Deterministic Global Optimization: Theory, Methods and Applications. Kluwer, Dordrecht (1999)

    Google Scholar 

  22. Floudas, C.A., Pardalos, P.M.: State of the Art in Global Optimization. Kluwer, Dordrecht (1996)

    Book  MATH  Google Scholar 

  23. Gaviano, M., Lera, D.: Complexity of general continuous minimization problems: a survey. Optim. Meth. Software 20, 525–544 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  24. Gaviano, M., Lera, D.: A global minimization algorithm for Lipschitz functions. Optim. Lett. 2, 1–13 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  25. Gaviano, M., Lera, D.: Properties and numerical testing of a parallel global optimization algorithm. Numer. Algorithm 60, 613–629 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  26. Gaviano, M., Lera, D., Steri, A.M.: A local search method for continuous global optimization. J. Global Optim. 48, 73–85 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  27. Gergel, V.P., Strongin, R.G.: Multiple Peano curves in recognition problems. Pattern Recogn. Image Anal. 2, 161–164 (1992)

    Google Scholar 

  28. Glover, F., Kochenberger, G.A.: Handbook on Metaheuristics, Kluwer, Dordrecht (2003)

    Google Scholar 

  29. Gornov, A.Yu., Zarodnyuk, T.S.: A method of stochastic coverings for optimal control problems. Comput. Technol. 17, 31–42 (2012) (In Russian)

    Google Scholar 

  30. Gorodetsky, S.Yu.: Multiextremal optimization based on domain triangulation. The Bulletin of Nizhni Novgorod “Lobachevsky” University: Math. Model. Optim. Contr. 21, 249–268 (1999) (In Russian)

    Google Scholar 

  31. Gorodetsky, S.Yu., Grishagin, V.A.: Nonlinear Programming and Multiextremal Optimization. NNGU Press, Nizhni Novgorod (2007) (In Russian)

    Google Scholar 

  32. Grishagin, V.A.: Operation characteristics of some global optimization algorithms. Prob. Stoch. Search 7, 198–206 (1978) (In Russian)

    MATH  Google Scholar 

  33. Grishagin, V.A.: On properties of a class of optimization algorithms. Transactions of the 3-rd Conference of Young Scientists of Applied Mathematics and Cybernetics Research Institute of Gorky University, Gorky, pp. 50–58. Deposited with VINITI, Aug.14, 1984, No.5836–84 Dep. (1983)

    Google Scholar 

  34. Hansen, P., Jaumard, B.: Lipshitz optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 407–493. Kluwer, Dordrecht (1995)

    Google Scholar 

  35. Hansen, P., Jaumard, B., Lu, S.H.: Global optimization of univariate Lipschitz functions: 2. New algorithms and computational comparison. Math. Program. 55, 273–293 (1992)

    MathSciNet  MATH  Google Scholar 

  36. Hastings, H.M., Sugihara, G.: Fractals: A User’s Guide for the Natural Sciences. Oxford University Press, Oxford (1994)

    MATH  Google Scholar 

  37. Hendrix, E.M.T., G.-Tóth, B.: Introduction to Nonlinear and Global Optimization. Springer, New York (2010)

    Google Scholar 

  38. Hilbert, D.: Űber die steitige abbildung einer linie auf ein fla̋chenstűck. Math. Ann. 38, 459–460 (1891)

    Article  MathSciNet  MATH  Google Scholar 

  39. Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer, Dordrecht (1995)

    MATH  Google Scholar 

  40. Iudin, D.I., Sergeyev, Ya.D., Hayakawa, M.: Interpretation of percolation in terms of infinity computations. Appl. Math. Comput. 218, 8099–8111 (2012)

    Google Scholar 

  41. Kushner, H.: A new method for locating the maximum point of an arbitrary multipeak curve in presence of noise. J. Basic Eng. 86, 97–106 (1964)

    Article  Google Scholar 

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

  43. Kvasov, D.E., Sergeyev, Ya.D.: Univariate geometric Lipschitz global optimization algorithms. Numer. Algebra Contr. Optim. 2, 69–90 (2012)

    Google Scholar 

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

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

    Google Scholar 

  46. Liuzzi, G., Lucidi, S., Piccialli, V.: A partition-based global optimization algorithm. J. Global Optim. 48, 113–128 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  47. Mandelbrot, B.: Les objets fractals: forme, hasard et dimension. Flammarion, Paris (1975)

    MATH  Google Scholar 

  48. Mockus, J.: Bayesian Approach to Global Optimization. Kluwer, Dordrecht (1988)

    Google Scholar 

  49. Moore, E.H.: On certain crinkly curves. Trans. Am. Math. Soc. 1, 72–90 (1900)

    Article  MATH  Google Scholar 

  50. Netto, E.: Beitrag zur Mannigfaltigkeitslehre. Journal für die reine und angewandte Mathematik (Crelle’s Journal) 86, 263–268 (1879)

    Google Scholar 

  51. Paulavicius, R., Žilinskas, J.: Analysis of different norms and corresponding Lipschitz constants for global optimization in multidimensional case. Inform. Technol. Contr. 36, 383–387 (2007)

    Google Scholar 

  52. Paulavicius, R., Žilinskas, J., Grothey, A.: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4, 173–183 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  53. Peano, G.: Sur une courbe, qui remplit toute une aire plane. Math. Ann. 36, 157–160 (1890)

    Article  MathSciNet  MATH  Google Scholar 

  54. Peitgen, H.-O., Jürgens, H., Saupe, D.: Chaos and Fractals. Springer, New York (1992)

    Book  Google Scholar 

  55. Pickover, C.A.: Chaos and Fractals: A Computer Graphical Journey. Elsevier, Amsterdam (1998)

    MATH  Google Scholar 

  56. Pijavskii, S.A.: An algorithm for finding the absolute minimum of a function. Optimum Decision Theory 2. Inst. of Cybern. of the Acad. of Sci. of the Ukr. SSR, Kiev, 13–24 (1967) (In Russian)

    Google Scholar 

  57. Pintér, J.: Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications). Kluwer, Dordrecht (1996)

    Book  Google Scholar 

  58. Platzman, L.K., Bartholdi, J.J. III: Spacefilling curves and the planar travelling salesman problem. J. ACM 36, 719–737 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  59. Sagan, H.: Space-Filling Curves. Springer, New York (1994)

    Book  MATH  Google Scholar 

  60. Sergeyev, Ya.D.: On convergence of “Divide the Best” global optimization algorithms. Optimization 44, 303–325 (1998)

    Google Scholar 

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

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

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

    Google Scholar 

  64. Sergeyev, Ya.D.: Blinking fractals and their quantitative analysis using infinite and infinitesimal numbers. Chaos Solitons Fract. 33, 50–75 (2007)

    Google Scholar 

  65. Sergeyev, Ya.D.: Using blinking fractals for mathematical modelling of processes of growth in biological systems. Informatica 22, 559–576 (2011)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

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

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

    Google Scholar 

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

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

  73. Sergeyev, Ya.D., Pugliese, P., Famularo, D.: Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints. Math. Program. 96, 489–512 (2003)

    Google Scholar 

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

  75. Sierpiński, W.: O krzywych, wypelniajacych kwadrat. Prace Mat.-Fiz. 23, 193–219 (1912)

    MATH  Google Scholar 

  76. Stephens, C.P., Baritompa, W.P.: Global optimization requires global information. J. Optim. Theor. Appl. 96, 575–588 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  77. Strekalovsky, A.S.: Global optimality conditions for nonconvex optimization. J. Global Optim. 4, 415–434 (1998)

    Article  MathSciNet  Google Scholar 

  78. Strekalovsky, A.S., Orlov, A.V., MalyshevA.V.: On computational search for optimistic solutions in bilevel problems. J. Global Optim. 48, 159– 172 (2010)

    Google Scholar 

  79. Strigul, O.I.: Search for a global extremum in a certain subclass of functions with the Lipschitz condition. Cybernetics 6, 72–76 (1985)

    MathSciNet  Google Scholar 

  80. Strongin, R.G.: On the convergence of an algorithm for finding a global extremum. Eng. Cybern. 11, 549–555 (1973)

    MathSciNet  Google Scholar 

  81. Strongin, R.G.: Numerical Methods in Multiextremal Problems. Nauka, Moskow (1978) (In Russian)

    Google Scholar 

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

    Google Scholar 

  83. Strongin, R.G.: Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves. J. Global Optim. 2, 357–378 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  84. Strongin, R.G., Gergel, V.P.: On realization of the generalized multidimensional global search algorithm on a computer. Problems of Cybernetics. Stochastic Search in Optimization Problems. Scientific Council of Academy of Sciences of USSR for Cybernetics, Moscow (1978) (In Russian)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  88. Sukharev, A.G.: Global extrema and methods of its search. In: Moiseev, N.N., Krasnoshchekov, P.S. (eds.) Mathematical Methods in Operations Research, pp. 4–37. Moscow University, Moscow (1981) (In Russian)

    Google Scholar 

  89. Sukharev, A.G.: Minimax Algorithms in Problems of Numerical Analysis. Nauka, Moscow (1989) (In Russian)

    MATH  Google Scholar 

  90. Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed–Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer, Dordrecht (2002)

    Google Scholar 

  91. Timonov, L.N.: An algorithm for search of a global extremum. Eng. Cybern. 15, 38–44 (1977)

    Google Scholar 

  92. Törn, A.A., \(\breve{Z}\)ilinskas, A.: Global Optimization. Lecture Notes in Computer Science, vol. 350. Springer, Berlin (1989)

    Google Scholar 

  93. Vanderbei, R.J.: Extension of Piyavskii’s algorithm to continuous global optimization. J. Global Optim. 14, 205–216 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  94. Vita, M.C., De Bartolo, S., Fallico, C., Veltri, M.: Usage of infinitesimals in the Menger’s Sponge model of porosity. Appl. Math. Comput. 218, 8187–8196 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  95. Watson, L.T., Baker, C.: A fully-distributed parallel global search algorithm. Eng. Comput. 18, 155–169 (2001)

    Article  MATH  Google Scholar 

  96. Wood, G.R., Zhang Baoping: Estimation of the Lipschitz constant of a function. J. Global Optim. 8, 91–103 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  97. Baoping, Z., Wood, G.R., Baritompa, W.: Multidimensional bisection: The performance and the context. J. Global Optim. 3, 337–358 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  98. Zhigljavsky, A.A.: Mathematical Theory of the Global Random Search. St. Petersburg University Press, St. Petersburg (1985) (In Russian)

    Google Scholar 

  99. Zhigljavsky, A.A., Žilinskas, A.: Stochastic Global Optimization. Springer, New York (2008)

    MATH  Google Scholar 

  100. Žilinskas, A., Mockus, J.: On one Bayesian method of search of the minimum. Avtomatica i Vychislitel’naya Teknika 4, 42–44 (1972) (In Russian)

    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). Introduction. 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_1

Download citation

Publish with us

Policies and ethics

Search

Navigation