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

**Data Assimilation: A Mathematical Introduction**

by

**K.J.H. Law, A.M. Stuart, K.C. Zygalakis**-

**arXiv.org**

This book provides a systematic treatment of the mathematical underpinnings of work in data assimilation. Authors develop a framework in which a Bayesian formulation of the problem provides the bedrock for the derivation and analysis of algorithms.

(

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

(

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

(

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

(

**3515**views)