Equivalent Methods for Global Optimization

  • Diane Maclagan
  • Timothy Sturge
  • William Baritompa
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 7)


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.


Global Optimization deterministic algorithms optimality 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    W. Baritompa. Customizing methods for global optimization — a geometric viewpoint.J. Global Optimization, 3: 193–212, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    W. Baritompa. Accelerations for a variety of global optimization methods. J.Global Optimization, 4: 37–45, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    W. Baritompa and A. Cutler. Accelerations for global optimization methods that use second derivative information.J. Global Optimization, 4: 329–341, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Leo Breiman and Adele Cutler. A deterministic algorithm for global optimization.Math. Program 58: 179–199, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Richard P. Brent .Algorithms for minimization without derivatives. Prentice-Hall, Englewood Cliffs, N.J., 1973.zbMATHGoogle Scholar
  6. 6.
    J. Pinter. Extended univariate algorithms for n-dimensional global optimization.Computing, 36: 91–103, 1986.MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    S.A. Piyavskii. An algorithm for finding the absolute extrema of a function.USSR Comp. Math, and Math. Phys., 12: 57–67, 1972.CrossRefGoogle Scholar
  8. 8.
    Yaroslav D. Sergeyev . Global optimization algorithms using smooth auxiliary functions. University of Calabria, Department of Mathematics, Report n. 5, 1994.Google Scholar
  9. 9.
    Bruno O. Shubert. A sequential method seeking the global maximum of a function.SIAM J. Numer. Anal., 9: 379–388, 1972.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Diane Maclagan
    • 1
  • Timothy Sturge
    • 1
  • William Baritompa
    • 1
  1. 1.Department of Mathematics and StatisticsUniversity of CanterburyChristchurchNew Zealand

Personalised recommendations