Skip to main content
Log in

A class of filled functions for finding global minimizers of a function of several variables

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

Abstract

This paper is concerned with filled function methods for finding global minimizers of a function of several variables. A class of filled functions is defined. The advantages and disadvantages of every filled function in the class are analyzed. The best one in this class is pointed out. The idea behind constructing a better filled function is given and employed to construct the class of filled functions. A method is also explored on how to locate minimizers or saddle points of a filled function through only the use of the gradient of a function.

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. Ge, R. P.,A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables, Paper Presented at the Dundee Biennial Conference on Numerical Analysis, Dundee, Scotland, 1983.

  2. Ge, R. P.,The Theory of the Filled Function Method for Finding a Global Minimizer of a Nonlinearly Constrained Minimization Problem, Paper Presented at the SIAM Conference on Numerical Optimization, Boulder, Colorado, 1984.

  3. Branin, F. H.,Solution of Nonlinear DC Network Problem via Differential Equations, Paper Presented at the IEEE International Conference on System Networks and Computers, Caxtepex, Mexico, 1971.

  4. Branin, F. H., andHoo, S. K.,A Method for Finding Multiple Extrema of a Function of n Variables, Numerical Methods of Nonlinear Optimization, Edited by F. Lootsma, Academic Press, New York, New York, 1972.

    Google Scholar 

  5. Dixon, L. C. W., Gomulka, J., andSzegö, G. P.,Toward a Global Optimization Technique, Toward Global Optimization, Edited by L. C. W. Dixon and G. P. Szego, North-Holland, Amsterdam, Holland, 1975.

    Google Scholar 

  6. Dixon, L. C. W., Gomulka, J., andHerson, S. E.,Reflections on the Global Optimization Problem, Optimization in Action, Edited by L. C. W. Dixon, Academic Press, New York, New York, 1976.

    Google Scholar 

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

    Google Scholar 

  8. Levy, A. V.,The Tunneling Algorithm for the Global Minimization of Functions, Paper Presented at the Dundee Biennial Conference on Numerical Analysis, Dundee, Scotland, 1977.

  9. Levy, A. V.,The Tunneling Method Applied to Global Optimization, Paper Presented at the SIAM Conference on Numerical Optimization, Boulder, Colorado, 1984.

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

    Google Scholar 

  11. Szegö, G. P.,Numerical Methods for Global Minimization, Proceedings of the IFAC Conference, Boston, Massachusetts, 1975.

  12. Treccani, G., Trabattoni, L., andSzegö, G. P.,A Numerical Method for the Isolation of Minima, Minimization Algorithms, Edited by G. P. Szegö, Academic Press, New York, New York, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by L. C. W. Dixon

The authors are indebted to Dr. L. C. W. Dixon for stimulating discussions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ge, R.P., Qin, Y.F. A class of filled functions for finding global minimizers of a function of several variables. J Optim Theory Appl 54, 241–252 (1987). https://doi.org/10.1007/BF00939433

Download citation

  • Issue Date:

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

Key Words

Navigation