Zhang, Liansheng; Ng, Chikong; Li, Duan; Tian, Weiwen A new filled function method for global optimization. (English) Zbl 1061.90109 J. Glob. Optim. 28, No. 1, 17-43 (2004). Summary: A novel filled function is suggested in this paper for identifying a global minimum point for a general class of nonlinear programming problems with a closed bounded domain. Theoretical and numerical properties of the proposed filled function are investigated and a solution algorithm is proposed. The implementation of the algorithm on several test problems is reported with satisfactory numerical results. Cited in 57 Documents MSC: 90C30 Nonlinear programming 90C26 Nonconvex programming, global optimization Keywords:Mathematical programming; Global optimization; Nonconvex optimization; Filled function method PDFBibTeX XMLCite \textit{L. Zhang} et al., J. Glob. Optim. 28, No. 1, 17--43 (2004; Zbl 1061.90109) Full Text: DOI