A filled function method for global optimization

作者：

Highlights：

•

摘要

A novel filled function with one parameter is suggested in this paper for finding a global minimizer for a general class of nonlinear programming problems with a closed bounded box. A new algorithm is presented according to the theoretical analysis. The implementation of the algorithm on several test problems is reported with satisfactory numerical results.

论文关键词：90C11,90C25,90C30,Local minimizer,Global optimization,Filled function method,Nonlinear programming

论文评审过程：Received 10 March 2006, Revised 12 April 2006, Available online 6 June 2006.

论文官网地址：https://doi.org/10.1016/j.cam.2006.04.038