×

zbMATH — the first resource for mathematics

Filled functions for unconstrained global optimization. (English) Zbl 1049.90092
Summary: This paper is concerned with filled function techniques for unconstrained global minimization of a continuous function of several variables. More general forms of filled functions are presented for smooth and non-smooth optimization problems. These functions have either one or two adjustable parameters. Conditions on functions and on the values of parameters are given so that the constructed functions have the desired properties of filled functions.

MSC:
90C30 Nonlinear programming
90C26 Nonconvex programming, global optimization
PDF BibTeX XML Cite
Full Text: DOI