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 filled function method for constrained global optimization
β Scribed by Z. Y. Wu; F. S. Bai; H. W. J. Lee; Y. J. Yang
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 200 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 c
In this paper, a new filled function which has better properties is proposed for identifying a global minimum point for a general class of nonlinear programming problems within a closed bounded domain. An algorithm for unconstrained global optimization is developed from the new filled function. Theo