a carefully selected group of methods for unconstrained and bound constrained optimization problems is analyzed in depth both theoretically and algorithmically. The book focuses on clarity in algorithmic description and analysis rather than generality, and also provides pointers to the literature for the most general theoretical results and robust software, We do not, for example, cover simulated annealing, genetic algorithms, response surface methods, or random search procedures. ... to generate the computational examples in the book, but the algorithms do not depend on the MATLAB environment and the reader can easily implement the algorithms in another language, either directly from the algorithmic descriptions or by translating the MATLAB code.
|Title||:||Iterative Methods for Optimization|
|Author||:||C. T. Kelley|
|Publisher||:||SIAM - 1999-01|