**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

**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.

(

**10955**views)

**Convex Optimization: Algorithms and Complexity**

by

**Sebastien Bubeck**-

**arXiv.org**

This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.

(

**1976**views)

**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.

(

**5985**views)

**Discrete Optimization**

by

**Guido Schaefer**-

**Utrecht University**

From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.

(

**4781**views)