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

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

(

**1146**views)

**Optimization and Dynamical Systems**

by

**U. Helmke, J. B. Moore**-

**Springer**

Aimed at mathematics and engineering graduate students and researchers in the areas of optimization, dynamical systems, control systems, signal processing, and linear algebra. The problems solved are those of linear algebra and linear systems theory.

(

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

(

**3149**views)

**Notes on Optimization**

by

**Pravin Varaiya**-

**Van Nostrand**

The author presents the main concepts mathematical programming and optimal control to students having diverse technical backgrounds. A reasonable knowledge of advanced calculus, linear algebra, and linear differential equations is required.

(

**7712**views)