A computable filled function used for global minimization

Authors:
Xian Liu
Affiliations:
Department of Systems Engineering, University of Arkansas at Little Rock, Little Rock, AR
Venue:
Applied Mathematics and Computation
Year:
2002

Citing 5
Cited 2

A class of filled functions for finding global minimizers of several variables

Journal of Optimization Theory and Applications
Global optimization

Global optimization
A filled function method for finding a global minimizer of a function of several variables

Mathematical Programming: Series A and B
The globally convexized filled functions for global optimization

Applied Mathematics and Computation
The filled function transformations for constrained global optimization

Applied Mathematics and Computation

Several filled functions with mitigators

Applied Mathematics and Computation
Global Descent Method for Global Optimization

SIAM Journal on Optimization

Quantified Score

Hi-index	0.48

Visualization

Abstract

The filled function method is an approach to find the global minimum of multimodal and multidimensional functions. This paper proposes a new filled function. This function needs only one parameter and includes neither exponential terms nor logarithmic terms. Furthermore, the lower bound of weight factor a is usually smaller than that of one previous formulation. Therefore, it is reasonable to expect that the proposed function has better computability than the previously reported ones.