Algorithms for minimization without derivatives
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 dep…
Borrow to read
This scan is available through Internet Archive's free lending library — sign in or create a free account below, then borrow to read.
Reader not loading? Open it on Archive.org instead.
