The filled function method is an effective approach to find a global minimizer. In this paper, based on a new definition of the filled function for nonsmooth constrained programming problems, a one-parameter filled function is constructed to improve the efficiency of numerical computation. Then a co
A one-parameter filled function method applied to nonsmooth constrained global optimization
โ Scribed by Ying Zhang; Ying-Tao Xu
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 520 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper, we propose a filled function method for solving nonsmooth constrained global optimization problems. Based on a new definition of the filled function, a more practical one-parameter filled function is constructed which overcomes some drawbacks of the previous filled functions. Then a corresponding algorithm is presented. It attains a local minimizer by implementing a local search procedure, and finds a better local minimizer gradually by optimizing the filled function constructed on the minimizer, previously found. By repeating these steps, a global minimizer is obtained. Numerical experiments are presented to show the practicability of the proposed filled function method. In the end, extension conceivable applications are given in order to evaluate the merits of this method.
๐ SIMILAR VOLUMES
A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t