Abstract
The paper is concerned with the filled functions for global optimization of a continuous function of several variables. More general forms of filled functions are presented for smooth and nonsmooth optimizations. These functions have either two adjustable parameters or one adjustable parameter. Conditions on functions and on the values of parameters are given so that the constructed functions are desired filled functions.
Similar content being viewed by others
References
Ge, R. P., A filled function method for finding a global minimizer of a function of several variables, Math. Programming, 1990, 46:191–204.
Ge, R. P. and Qin, Y. F., A class of filled functions for finding a global minimizer of a function of several variables, J. Optim. Theory Appl., 1987 54(2):241–252.
Ge, R. P., The theory of filled function methods for finding global minimizers of nonlinearly constrained minimization problems, Journal of Comput. Math., 1987 5(1):1–9.
Kong, M. and Zhuang, J. N., A modified filled function method for finding a global minimizer of a nonsmooth function of several variables, Numerical Mathematics—A Journal of Chinese Universities, 1996, 18(2):165–174.
Ge, R. P. and Qin, Y. F., The globally convexized filled functions for globally optimization, Appl. Math. and Comput., 1990, 35:131–158.
Fletcher, R., Practical Methods of Optimization, Vol. 2, Constrained Optimization, John Wiley & Sons, 1981.
Clarke, F. H., Optimization and Nonsmooth Analysis, John Wiley & Sons, 1983.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zheng, X., Chengxian, X. Filled functions for unconstrained global optimization. Appl. Math. Chin. Univ. 15, 307–318 (2000). https://doi.org/10.1007/s11766-000-0056-x
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11766-000-0056-x