A filled function with one parameter approach for box constrained optimization problem

摘要

The box constrained optimization appears in a wide range of scientific application. Therefore, box constrained problems continue to attract research interest. We address box constrained global optimization by deriving a new filled function with one parameter algorithm, we also prove the analysis properties of the proposed function under some suitable assumptions. Moreover, we show that the unconstrained minimization allows to escape from a local minima of the original objective function. We give experiment results on a solution of problems with different properties.