Accelerations for global optimization covering methods using second derivatives
β Scribed by William Baritompa; Adele Cutler
- Publisher
- Springer US
- Year
- 1994
- Tongue
- English
- Weight
- 710 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A general method designed to isolate the global minimum of a multidimensional objective function with multiple minima is presented. The algorithm exploits an integral ''coarse-graining'' transformation of the objective function, U, into a smoothed function with few minima. When the coarsegraining is
Signomial geometric programming (SGP) has been an interesting problem for many authors recently. Many methods have been provided for finding locally optimal solutions of SGP, but little progress has been made for global optimization of SGP. In this paper we propose a new accelerating method for glob