A new filled function method for unconstrained global optimization

The problem of finding a global minimum of a given function \(f(x)\) on \(\mathbb{R}^n\) is considered. It is assumed that \(f\) is Lipschitz continuous on \(\mathbb{R}^n\) and that \(f(x)\to\infty\) as \(\|x\|\to\infty\). This last assumption implies that there exists a compact set \(\Omega\subset \mathbb{R}^n\), the interior of which contains all minimizers of \(f(x)\), so that the original problem is equivalent to minimization of \(f(x)\) subject to \(x\in\Omega\). The authors propose a new filled function with two parameters (definition of the filled function see in [\textit{Y. J. Yang} and \textit{Y. L. Shang}, A new filled function method for constraint global optimization, Appl. Math. Comput. 173, 501--512 (2006; Zbl 1094.65063)] and develop a new algorithm for global minimization of \(f(x)\) using the proposed filled function. Theoretical and numerical properties of the proposed filled function are investigated. Satisfactory numerical properties of the algorithm are demonstrated on 7 test problems in the concluding part of the paper.

Recommendations

Cites work

Cited in

(29)

This page was built for publication: A new filled function method for unconstrained global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901455)