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.

  • [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. · 1.36 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A method is described for globally minimizing concave functions over convex sets whose defining constraints may be nonlinear. The algorithm generates linear programs whose solutions minimize the convex envelope of the original function over successively tighter polytopes enclosing the feasible region. The algorithm does not involve cuts of the feasible region, requires only simplex pivot operations and univariate search computations to be performed, allows the objective function to be lower semicontinuous and nonseparable, and is guaranteed to converge to the global solution. Computational aspects of the algorithm are discussed.
    Mathematical Programming 11/1981; 20(1):22-32. · 1.98 Impact Factor
  • Source
    Journal of the Operational Research Society 07/1996; · 0.91 Impact Factor