A class of filled functions for finding global minimizers of several variables
Journal of Optimization Theory and Applications
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
Finding Global Minima with a Computable Filled Function
Journal of Global Optimization
Filled functions for unconstrained global optimization
Journal of Global Optimization
A new filled function applied to global optimization
Computers and Operations Research
A New Filled Function Method for Global Optimization
Journal of Global Optimization
A discrete filled function algorithm for approximate global solutions of max-cut problems
Journal of Computational and Applied Mathematics
A new discrete filled function method for solving large scale max-cut problems
Numerical Algorithms
Hi-index | 0.00 |
Filled function method is a type of efficient methods to solve global optimization problems arisen in non-convex programming. In this paper, a new class of filled functions is proposed. This class of filled functions has only one adjustable parameter a. Several examples of this class of filled functions with specified parameter values are given, which contain the filled functions proposed in [3] and [4]. These examples show this class of filled functions contains more simple functions, therefore this class of filled functions have better computability. An algorithm employing the proposed filled function is presented, and numerical experiments show that the proposed filled functions are efficient.