**Iterative Methods for Optimization**

by C.T. Kelley

**Publisher**: Society for Industrial Mathematics 1987**ISBN/ASIN**: 0898714338**ISBN-13**: 9780898714333**Number of pages**: 188

**Description**:

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.

Download or read it online for free here:

**Download link**

(1.4MB, PDF)

## Similar books

**Robust Optimization**

by

**A. Ben-Tal, L. El Ghaoui, A. Nemirovski**-

**Princeton University Press**

Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of this relatively new approach to optimization.

(

**4330**views)

**Optimization Algorithms on Matrix Manifolds**

by

**P.-A. Absil, R. Mahony, R. Sepulchre**-

**Princeton University Press**

Many science and engineering problems can be rephrased as optimization problems on matrix search spaces endowed with a manifold structure. This book shows how to exploit the structure of such problems to develop efficient numerical algorithms.

(

**11026**views)

**Linear Optimisation and Numerical Analysis**

by

**Ian Craw**-

**University of Aberdeen**

The book describes the simplex algorithm and shows how it can be used to solve real problems. It shows how previous results in linear algebra give a framework for understanding the simplex algorithm and describes other optimization algorithms.

(

**9143**views)

**Linear Programming**

by

**Jim Burke**-

**University of Washington**

These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.

(

**2151**views)