Iterative Methods for Optimization
$81.99 (P)
Part of Frontiers in Applied Mathematics
- Author: C. T. Kelley, North Carolina State University
- Date Published: January 1987
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
- format: Paperback
- isbn: 9780898714333
$
81.99
(P)
Paperback
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
-
This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis rather than generality, and while it provides pointers to the literature for the most general theoretical results and robust software, the author thinks it is more important that readers have a complete understanding of special cases that convey essential ideas. A companion to Kelley's book, Iterative Methods for Linear and Nonlinear Equations (SIAM, 1995), this book contains many exercises and examples and can be used as a text, a tutorial for self-study, or a reference. Iterative Methods for Optimization does more than cover traditional gradient-based optimization: it is the first book to treat sampling methods, including the Hooke–Jeeves, implicit filtering, MDS, and Nelder–Mead schemes in a unified way.
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: January 1987
- format: Paperback
- isbn: 9780898714333
- length: 196 pages
- dimensions: 255 x 178 x 10 mm
- weight: 0.363kg
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Table of Contents
Preface
How to Get the Software
Part I: Optimization of Smooth Functions
Chapter 1: Basic Concepts
Chapter 2: Local Convergence of Newton's Method
Chapter 3: Global Convergence
Chapter 4: The BFGS Method
Chapter 5: Simple Bound Constraints
Part II: Optimization of Noisy Functions
Chapter 6: Basic Concepts and Goals
Chapter 7: Implicit Filtering
Chapter 8: Direct Search Algorithms
Bibliography
Index.
Related Books
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×