# zbMATH — the first resource for mathematics

A filled function method for finding a global minimizer of a function of several variables. (English) Zbl 0694.90083
This paper is concerned with the problem of finding a global minimizer of a twice continuously differentiable function F(x) on $$R^ n$$, with $$F(x)\to +\infty$$ as $$\| x\| \to +\infty$$. The concept of filled function is introduced, a particular filled function is constructed and its properties are analyzed. An algorithm for global minimization is generated based on this concept and properties of the filled function. Some typical examples with 1 to 10 variables are tested and computational results show that in most cases this algorithm works better then the tunneling algorithm. The advantages and disadvantages are analyzed and further research directions are discussed.
Reviewer: J.Ramik

##### MSC:
 90C30 Nonlinear programming 65K05 Numerical mathematical programming methods 65K10 Numerical optimization and variational techniques
Full Text:
##### References:
 [1] F. Archetti and B. Betro, ”A priori analysis of deterministic strategies for global optimization,” in: L.C.W. Dixon and G.P. Szegö, eds.,Towards Global Optimization, Vol. 2 (North-Holland, Amsterdam, 1978) pp. 31–48. · Zbl 0404.90082 [2] E.M.L. Beale and J.J.H. Forrest, ”Global optimization as an extension of integer programming,” in: L.C.W. Dixon and G.P. Szegö, eds.,Towards Global Optimization, Vol. 2 (North-Holland, Amsterdam, 1978) pp. 131–149. · Zbl 0397.90086 [3] F.H. Branin, ”Solution of nonlinear DC network problem via differential equations,” in:International IEEE Conference on System Network & Computers (Oaxtepex, Mexico, 1971). [4] F.H. Branin and S.K. Hoo, ”A method for finding multiple extrema of a function ofn variables,” in: F. Lootsma, ed.,Numerical Methods of Nonlinear Optimization (Academic Press, New York, 1972) pp. 231–238. · Zbl 0271.65035 [5] L.C.W. Dixon, J. Gomulka and S.E. Herson, ”Reflections on global optimization problem,” in: L.C.W. Dixon, ed.,Optimization in Action (Academic Press, New York, 1976) pp. 398–435. [6] L.C.W. Dixon, J. Gomulka and G.P. Szegö, ”Towards global optimization technique,” in: L.C.W. Dixon and G.P. Szegö, eds.,Towards Global Optimization (North-Holland, Amsterdam, 1975) pp. 29–54. [7] A.A. Goldstein and J.F. Price, ”On descent from a local minimum,”Mathematics of Computation 25 (1977) 569–574. · Zbl 0223.65020 · doi:10.1090/S0025-5718-1971-0312365-X [8] J. Gomulka, ”Deterministic VS probabilistic approach to global optimization,” in: L.C.W. Dixon and G.P. Szegö, eds.,Towards Global Optimization Vol. 2, (North-Holland, Amsterdam, 1978) pp. 19–29. · Zbl 0401.90087 [9] A.L. Levy, ”The tunneling algorithm for the global minimization of functions,” presented at:The Dundee biennial Conference on Numerical Analysis (Dundee, Scotland, 1977). [10] W.L. Price, ”A controlled random search procedure for global optimization,” in: L.C.W. Dixon and G.P. Szegö, eds.,Towards Global Optimization, Vol. 2 (North-Holland, Amsterdam, 1978) pp. 71–84. · Zbl 0394.90092 [11] B.O. Shubert, ”A sequential method seeking the global minimum of a function,”SIAM Journal Numerical Analysis 9 (3) (1972) 379–388. · Zbl 0251.65052 · doi:10.1137/0709036 [12] G. Trecanni, ”A global descent optimization strategy,” in: L.C.W. Dixon and G.P. Szegö, eds.,Towards Global Optimization, Vol. 2 (North-Holland, Amsterdam, 1978) pp. 165–177.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.