Skip to Main Content
A new filled function is proposed for solving constrained global optimization problems without the coercive condition. The filled function is proposed for escaping the current local minimizer of a constrained global problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Some numerical results on some typical test problems using algorithm demonstrate the efficiency of the algorithm.
Date of Conference: 3-4 Dec. 2011