A new algorithm for constrained global optimization based on filled function
Dept. of Math., Shanghai Second Polytech. Univ., ShanghaiDOI: 10.1109/ICALIP.2008.4589953 Conference: Audio, Language and Image Processing, 2008. ICALIP 2008. International Conference on
Source: IEEE Xplore
In this paper, we propose a filled function method for constrained global optimization. This filled function contains only one parameter which is easily to be chosen. Then we investigate the properties of this function and design a new algorithm based on this function. Last, we make a numerical test. The numerical results show the efficiency of this global optimization method.
- [Show abstract] [Hide abstract]
ABSTRACT: A new filled function with one parameter is proposed for solving constrained global optimization problems without the coercive condition, in which the filled function contains neither exponential term nor fractional term and is easy to be calculated. A corresponding filled function algorithm is established based on analysis of the properties of the filled function. At last, we perform numerical experiments on some typical test problems using the algorithm and the detailed numerical results show that the algorithm is effective.Applied Mathematics and Computation 02/2011; 217(12):5853-5859. DOI:10.1016/j.amc.2010.12.070 · 1.55 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.