skip to content
Algorithms for minimization without derivatives Preview this item
ClosePreview this item
Checking...

Algorithms for minimization without derivatives

Author: R P Brent
Publisher: Englewood Cliffs, N.J. : Prentice-Hall, 1972, ©1973.
Series: Prentice-Hall series in automatic computation.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Extremwertbestimmung
Additional Physical Format: Online version:
Brent, R.P. (Richard P.).
Algorithms for minimization without derivatives.
Englewood Cliffs, N.J., Prentice-Hall [1972, ©1973]
(OCoLC)567965277
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: R P Brent
ISBN: 0130223352 9780130223357
OCLC Number: 515987
Description: xii, 195 pages : illustrations ; 24 cm.
Contents: Preface --
Introduction and summary --
Some useful results on Taylor series, divided differences, and LaGrange interpolation --
The use of successive interpolation for finding simple zeros of a function and its derivatives --
An algorithm with guaranteed convergence for finding a zero of a function --
An algorithm with guaranteed convergence for finding a minimum of a function of one variable --
Global minimization given an upper bound on the second derivative --
A new algorithm for minimizing a function of several variable without calculating derivatives.
Series Title: Prentice-Hall series in automatic computation.
Responsibility: Richard P. Brent.

Abstract:

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/515987>
library:oclcnum"515987"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:copyrightYear"1973"
schema:creator
schema:datePublished"1972"
schema:description"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."@en
schema:description"Preface -- Introduction and summary -- Some useful results on Taylor series, divided differences, and LaGrange interpolation -- The use of successive interpolation for finding simple zeros of a function and its derivatives -- An algorithm with guaranteed convergence for finding a zero of a function -- An algorithm with guaranteed convergence for finding a minimum of a function of one variable -- Global minimization given an upper bound on the second derivative -- A new algorithm for minimizing a function of several variable without calculating derivatives."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1496444>
schema:genre"Extremwertbestimmung"@en
schema:inLanguage"en"
schema:isPartOf
schema:name"Algorithms for minimization without derivatives"@en
schema:publication
schema:publisher
schema:workExample
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.