Skip to main content
SpringerLink
Log in

Approximations to Peano Curves: Algorithms and Software

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

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

Abstract

Due to the important role the space-filling curves play in the subsequent treatment it is appropriate to fix this term by some formal statement.

In rallying every curve, every hill may be different than you thought. That makes it interesting.

Kimi Raikkonen

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. Barkalov, K., Ryabov, V., Sidorov, S.: Parallel scalable algorithms with mixed local-global strategy for global optimization problems. In: Hsu, C.H., Malyshkin, V. (eds.) MTPP 2010. LNCS 6083, pp. 232–240. Springer, Berlin (2010)

    Google Scholar 

  2. Gergel, V.P., Strongin, L.G., Strongin, R.G.: Neighbourhood method in recognition problems. Soviet J. Comput. Syst. Sci. 26, 46–54 (1988)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

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

    Google Scholar 

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

    Google Scholar 

  9. 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). Approximations to Peano Curves: Algorithms and Software. 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_2

Download citation

Publish with us

Policies and ethics

Search

Navigation