Iterative Methods for Optimization
C.T. Kelley, North Carolina State University
SIAM, 1999
ISBN: 0-89871-433-8;
Language: English
This book is suitable for use as a tutorial, a reference, or a textbook in an introductory optimization course. It presents a carefully selected group of methods for unconstrained and bound-constrained optimization problems and analyzes them in depth, both theoretically and algorithmically. Readers should be familiar with the material in an elementary graduate-level course in numerical analysis, and with local convergence results for systems of nonlinear equations. The book focuses on clarity in algorithmic description and analysis rather than generality. It covers more than the traditional gradient-based opitimization; it treats sampling methods, including the Hooke-Jeeves, implicit filtering, MDS, and Nelder-Mead schemes, in a unified way, and also makes connections between sampling methods and the traditional gradient methods.
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list
How to Get Best Site Performance
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)