Skip to main content

Equivalent Methods for Global Optimization

  • Chapter
State of the Art in Global Optimization

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 7))

Abstract

The envelope used by the algorithm of Breiman and Cutler [4] can be smoothed to create a better algorithm. This is equivalent to an accelerated algorithm developed by the third author and Cutler in [3] which uses apparently poor envelopes. Explaining this anomaly lead to a general result concerning the equivalence of methods which use information from more than one point at each stage and those that only use the most recent evaluated point. Smoothing is appropriate for many algorithms, and we show it is an optimal strategy.

Part of an Honours III project by the first two authors under the supervision of the third.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Baritompa. Customizing methods for global optimization — a geometric viewpoint.J. Global Optimization, 3: 193–212, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  2. W. Baritompa. Accelerations for a variety of global optimization methods. J.Global Optimization, 4: 37–45, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  3. W. Baritompa and A. Cutler. Accelerations for global optimization methods that use second derivative information.J. Global Optimization, 4: 329–341, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  4. Leo Breiman and Adele Cutler. A deterministic algorithm for global optimization.Math. Program 58: 179–199, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  5. Richard P. Brent .Algorithms for minimization without derivatives. Prentice-Hall, Englewood Cliffs, N.J., 1973.

    MATH  Google Scholar 

  6. J. Pinter. Extended univariate algorithms for n-dimensional global optimization.Computing, 36: 91–103, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  7. S.A. Piyavskii. An algorithm for finding the absolute extrema of a function.USSR Comp. Math, and Math. Phys., 12: 57–67, 1972.

    Article  Google Scholar 

  8. Yaroslav D. Sergeyev . Global optimization algorithms using smooth auxiliary functions. University of Calabria, Department of Mathematics, Report n. 5, 1994.

    Google Scholar 

  9. Bruno O. Shubert. A sequential method seeking the global maximum of a function.SIAM J. Numer. Anal., 9: 379–388, 1972.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Kluwer Academic Publishers

About this chapter

Cite this chapter

Maclagan, D., Sturge, T., Baritompa, W. (1996). Equivalent Methods for Global Optimization. In: Floudas, C.A., Pardalos, P.M. (eds) State of the Art in Global Optimization. Nonconvex Optimization and Its Applications, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3437-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3437-8_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3439-2

  • Online ISBN: 978-1-4613-3437-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics