Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Outstanding text for graduate students and research workers proposes improvements to existing algorithms, extends their related mathematical theories, and offers details on new algorithms for approximating local and global minima. Many numerical examples, along with complete analysis of rate of convergence for most of the algorithms and error bounds that allow for the effect of rounding errors.
Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previews available in: English
Showing 2 featured editions. View all 2 editions?
Edition | Availability |
---|---|
1
Algorithms for minimization without derivatives
2002, Dover Publications
in English
0486419983 9780486419985
|
zzzz
Libraries near you:
WorldCat
|
2
Algorithms for minimization without derivatives
1972, Prentice-Hall
in English
0130223352 9780130223357
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Bibliography: p. 169-185.
Classifications
The Physical Object
ID Numbers
Source records
Better World Books recordLibrary of Congress MARC record
Internet Archive item record
harvard_bibliographic_metadata record
Work Description
This outstanding text for graduate students and researchers proposes improvements to existing algorithms, extends their related mathematical theories, and offers details on new algorithms for approximating local and global minima. None of the algorithms requires an evaluation of derivatives; all depend entirely on sequential function evaluation, a highly practical scenario in the frequent event of difficult-to-evaluate derivatives.
Topics include the use of successive interpolation for finding simple zeros of a function and its derivatives; an algorithm with guaranteed convergence for finding a minimum of a function of one variation; global minimization given an upper bound on the second derivative; and a new algorithm for minimizing a function of several variables without calculating derivatives. Many numerical examples augment the text, along with a complete analysis of rate of convergence for most algorithms and error bounds that allow for the effect of rounding errors.
Community Reviews (0)
Feedback?March 26, 2021 | Edited by MARC Bot | import existing book |
May 13, 2016 | Edited by Mithun Jacob | added description |
November 28, 2012 | Edited by AnandBot | Fixed spam edits. |
November 26, 2012 | Edited by | Edited without comment. |
December 10, 2009 | Created by WorkBot | add works page |