Advertisement

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

  • R. P. Ge
  • Y. F. Qin
Contributed Papers

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.

Key Words

Global minimizer basin (region of attraction) of a minimizer lower minimizer higher minimizer filled (modified) function method 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 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. 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. 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. 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. 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.Google Scholar
  9. 9.
    Levy, A. V.,The Tunneling Method Applied to Global Optimization, Paper Presented at the SIAM Conference on Numerical Optimization, Boulder, Colorado, 1984.Google Scholar
  10. 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. 11.
    Szegö, G. P.,Numerical Methods for Global Minimization, Proceedings of the IFAC Conference, Boston, Massachusetts, 1975.Google Scholar
  12. 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

Copyright information

© Plenum Publishing Corporation 1987

Authors and Affiliations

  • R. P. Ge
    • 1
  • Y. F. Qin
    • 2
  1. 1.Institute of Applied and Computational MathematicsXian Jiaotong UniversityXianChina
  2. 2.Computer CenterXian Jiaotong UniversityXianChina

Personalised recommendations