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.
Algorithms for Minimization Without Derivatives (Dover Books on Mathematics)
📄 Viewing lite version
Full site ›
Book Details
Author(s)Richard P. Brent
PublisherDover Publications
ISBN / ASIN0486419983
ISBN-139780486419985
AvailabilityUsually ships in 24 hours
Sales Rank1,475,856
CategoryMathematics
MarketplaceUnited States 🇺🇸
Description ▲
More Books in Mathematics
Topics in Finite and Discrete Mathematics
View
Applications of Mathematics in Engineering and Economi…
View
Linear Algebra Supplement to Accompany Calculus with A…
View
Random Matrix Models and their Applications (Mathemati…
View
Continuous Crossed Products and Type III Von Neumann A…
View
First European Congress of Mathematics Paris, July 6-1…
View
Workshop Statistics: Discovery with Data, JMP Companio…
View
XXVI International Workshop on Geometrical Methods in …
View
Social Policy Reform in Hong Kong and Shanghai: A Tale…
View