التفاصيل البيبلوغرافية
| العنوان: |
Grid Restrained Nelder-Mead Algorithm. |
| المؤلفون: |
Brűmen, Árpád, Puhan, Janez, Tuma, Tadej |
| المصدر: |
Computational Optimization & Applications; Jul2006, Vol. 34 Issue 3, p359-375, 17p, 2 Charts |
| مصطلحات موضوعية: |
ALGORITHMS, STOCHASTIC convergence, ALGEBRA, FOUNDATIONS of arithmetic, HYDROMEL, MEAD, SIMPLEXES (Mathematics), SET theory, NUMERICAL range |
| مستخلص: |
Probably the most popular algorithm for unconstrained minimization for problems of moderate dimension is the Nelder-Mead algorithm published in 1965. Despite its age only limited convergence results exist. Several counterexamples can be found in the literature for which the algorithm performs badly or even fails. A convergent variant derived from the original Nelder-Mead algorithm is presented. The proposed algorithm's convergence is based on the principle of grid restrainment and therefore does not require sufficient descent as the recent convergent variant proposed by Price, Coope, and Byatt. Convergence properties of the proposed grid-restrained algorithm are analysed. Results of numerical testing are also included and compared to the results of the algorithm proposed by Price et al. The results clearly demonstrate that the proposed grid-restrained algorithm is an efficient direct search method. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Find this article in full text from Springer Verlag. 
Full Text Finder