- Title
- Global descent methods for unconstrained global optimization
- Creator
- Wu, Zhiyou; Li, Duan; Zhang, Lian-Sheng
- Date
- 2011
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/44519
- Identifier
- vital:4073
- Identifier
-
https://doi.org/10.1007/s10898-010-9587-8
- Identifier
- ISSN:0925-5001
- Abstract
- We propose in this paper novel global descent methods for unconstrained global optimization problems to attain the global optimality by carrying out a series of local minimization. More specifically, the solution framework consists of a two-phase cycle of local minimization: the first phase implements local search of the original objective function, while the second phase assures a global descent of the original objective function in the steepest descent direction of a (quasi) global descent function. The key element of global descent methods is the construction of the (quasi) global descent functions which possess prominent features in guaranteeing a global descent. © 2010 Springer Science+Business Media, LLC.
- Publisher
- Springer
- Relation
- Journal of Global Optimization Vol. 50, no. 3 (2011), p. 379-3976
- Rights
- Green - author can archive pre-print & post-print
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0103 Numerical and Computational Mathematics; 0102 Applied Mathematics; Global descent method; Global optimization; Local search; Modified function approach; Non-convex optimization
- Reviewed
- Hits: 1205
- Visitors: 1170
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|