Skip to main content
Log in

Cord-slope form of Taylor's expansion in univariate global optimization

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Interval arithmetic and Taylor's formula can be used to bound the slope of the cord of a univariate function at a given point. This leads in turn to bounding the values of the function itself. Computing such bounds for the function, its first and second derviatives, allows the determination of intervals in which this function cannot have a global minimum. Exploiting this information together with a simple branching rule yields an efficient algorithm for global minimization of univariate functions. Computational experience is reported.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ganshin, G. S.,Function Maximization, USSR Computational Mathematics and Mathematical Physics, Vol. 16, pp. 26–36, 1976.

    Google Scholar 

  2. Ganshin, G. S.,Optimal Passive Algorithms for Evaluating the Maximum of a Function in an Interval, USSR Computational Mathematics and Mathematical Physics, Vol. 17, pp. 8–17, 1977.

    Google Scholar 

  3. Ivanov, V. V.,On the Optimal Algorithms of Minimization in the Class of Functions with the Lipschitz Condition, Information Processing, Vol. 71, pp. 1324–1327, 1972.

    Google Scholar 

  4. Pevnyi, A. V.,On Optimal Search Strategies for the Maximum of a Function with Bounded Highest Derivative, USSR Computational Mathematics and Mathematical Physics, Vol. 22, pp. 38–44, 1982.

    Google Scholar 

  5. Sukharev, A. G.,Optimal Strategies of the Search for an Extremum, USSR Computational Mathematics and Mathematical Physics, Vol. 11, pp. 119–137, 1971.

    Google Scholar 

  6. Zaliznyak, N. F., andLigun, A. A.,Optimal Strategies for Seeking the Global Maximum of a Function, USSR Computational Mathematics and Mathematical Physics, Vol. 18, pp. 31–38, 1978.

    Google Scholar 

  7. Brent, R. P.,Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, New Jersey, 1973.

    Google Scholar 

  8. Ganshin, G. S.,Simplest Sequential Search Algorithm for the Largest Value of a Twice-Differentiable Function, USSR Computational Mathematics and Mathematical Physics, Vol. 16, pp. 508–509, 1976.

    Google Scholar 

  9. Vasil'ev, S. B., andGanshin, G. S.,Sequential Search Algorithm for the Largest Value of a Twice Differentiable Function, USSR Computational Mathematics and Mathematical Physics, Vol. 31, pp. 312–316, 1982.

    Google Scholar 

  10. Hansen, P., Jaumard, B., andLu, S. H.,Global Minimization of Univariate Functions by Sequential Polynomial Approximation, International Journal of Computer Mathematics, Vol. 28, pp. 183–193, 1989.

    Google Scholar 

  11. Jacobsen, S. E., andTorabi, M.,A Global Minimization Algorithm for a Class of One-Dimensional Functions, Journal of Mathematical Analysis and Applications, Vol. 62, pp. 310–324, 1978.

    Google Scholar 

  12. Hansen, E.,Global Optimization Using Interval Analysis: The One-Dimensional Case, Journal of Optimization Theory and Applications, Vol. 29, pp. 331–334, 1979.

    Google Scholar 

  13. McCormick, G. P.,Finding the Global Minimum of a Function of One Variable Using the Methods of Constant Signed Higher-Order Derivatives, Nonlinear Programming 4, Edited by P. R. Meyer and S. M. Robinson, Academic Press, New York, New York, pp. 223–243, 1981.

    Google Scholar 

  14. Shen, Z., andZhu, Y.,An Interval Version of Shubert's Iterative Method for the Localization of the Global Maximum, Computing, Vol. 38, pp. 175–280, 1987.

    Google Scholar 

  15. Evtushenko, Y. G.,Numerical Methods for Finding Global Extrema: Case of a Nonuniform Mesh, USSR Computational Mathematics and Mathematical Physics, Vol. 11, pp. 38–54, 1971.

    Google Scholar 

  16. Bromberg, M., andChang, T. S.,One-Dimensional Global Optimization Using Linear Lower Bounds, Recent Advances in Global Optimization, Edited by C. A. Floudas and P. M. Pardalos, Princeton University Press, Princeton, New Jersey, pp. 200–220, 1992.

    Google Scholar 

  17. Moore, R. E.,Interval Analysis, Prentice-Hall, Englewood Cliffs, New Jersey, 1966.

    Google Scholar 

  18. Ratschek, H., andRokne, J.,Computer Methods for the Range of Functions, Ellis Horwood, Chichester, England, 1984.

    Google Scholar 

  19. Ratschek, H., andRokne, J.,New Computer Methods for Global Optimization, Ellis Horwood, Chichester, England, 1988.

    Google Scholar 

  20. Aho, A. V., Hopcroft, J. E., andUllman, J. D.,Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.

    Google Scholar 

  21. Timonov, L. N.,An Algorithm for Search of a Global Extremum, Engineering Cybernetics, Vol. 15, pp. 38–44, 1977.

    Google Scholar 

  22. Hansen, P., Jaumard, B., andLu, S. H.,Global Optimization of Univariate Lipschitz Functions, Part 2: New Algorithms and Computational Comparison, Mathematical Programming, Vol. 55, pp. 273–292, 1992.

    Google Scholar 

  23. Shubert, B. O.,A Sequential Method Seeking the Global Maximum of a Function, SIAM Journal on Numerical Analysis, Vol. 9, pp. 379–388, 1972.

    Google Scholar 

  24. Levy, A. V., et al.,Topics in Global Optimization, Lecture Notes on Mathematics, Springer-Verlag, New York, New York, Vol. 909, pp. 18–47, 1981.

    Google Scholar 

  25. Walster, G. W., Hansen, E. R., andSengupta, S.,Test Results for a Global Optimization Algorithm, Numerical Optimization 1984, Edited by P. T. Boggs, SIAM, Philadelphia, Pennsylvania, pp. 272–287, 1985.

    Google Scholar 

  26. Fichtenholz, G. M.,Differential- und Integralrechnung, Part 1, Springer-Verlag, Berlin, Germany, 1964.

    Google Scholar 

  27. Marsden, J., andWeinstein, A.,Calculus, Part 1, Springer-Verlag, New York, New York, 1985.

    Google Scholar 

  28. Goldstein, A. A., andPrice, J. F.,On Descent from Local Minima, Mathematics of Computation, Vol. 25, pp. 569–574, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by J. Abadie

The first and second authors have been supported by FCAR (Fonds pour la Formation de Chercheurs et l'Aide à la Recherche) Grant 92EQ1048 and AFOSR Grant 90-0008 to Rutgers University. The first author has also been supported by NSERC (Natural Sciences and Engineering Research Council of Canada) Grant to HEC and NSERC Grant GP0105574. The second author has been supported by NSERC Grant GP0036426, FCAR Grant 90NC0305, and a NSF Visiting Professorship for Women in Science at Princeton University. Work of the third author was done in part while he was a graduate student at the Department of Mathematics, Rutgers University, New Brunswick, New Jersey, USA and during a visit to GERAD, June–August 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hansen, P., Jaumard, B. & Xiong, J. Cord-slope form of Taylor's expansion in univariate global optimization. J Optim Theory Appl 80, 441–464 (1994). https://doi.org/10.1007/BF02207774

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02207774

Key Words

Navigation