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
The filled function transformations for constrained global optimization
โ Scribed by Renpu Ge
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 856 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0096-3003
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
This paper considers the nonlinearly constrained continuous global minimization problem. Based on the idea of the penalty function method, an auxiliary function, which has approximately the same global minimizers as the original problem, is constructed. An algorithm is developed to minimize the auxi
This paper is concerned with integrating global data transformations and local loop transformations in order to minimize overhead on distributed shared memory machines such as the SGi Origin 2000. By first developing an extended algebraic transformation framework, a new technique to allow the static