Conference Paper

A new algorithm for constrained global optimization based on filled function

Dept. of Math., Shanghai Second Polytech. Univ., Shanghai
DOI: 10.1109/ICALIP.2008.4589953 Conference: Audio, Language and Image Processing, 2008. ICALIP 2008. International Conference on
Source: IEEE Xplore

ABSTRACT 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.

0 Followers
 · 
82 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: 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.
    Journal of Global Optimization 01/2001; 20(1):49-65. DOI:10.1023/A:1011207512894 · 1.36 Impact Factor
  • Source
    Journal of the Operational Research Society 07/1996; DOI:10.1057/jors.1996.163 · 0.91 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Seeking global optima of an unconstrained and multi-modal global optimization problem minx∈Ωf(x) by constructing a filled function is concerned in this paper. On the basis of analyzing filled functions presented before, a new filled function is proposed, and it is proved to meet the properties of a filled function. Moreover, solutions of numerical experiments show that the function is quite effective.
    Applied Mathematics and Computation 03/2006; 174(1):419-429. DOI:10.1016/j.amc.2005.05.009 · 1.60 Impact Factor