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

**Universal Optimization and Its Application**

by

**Alexander Bolonkin**-

**viXra.org**

This book describes new method of optimization (''Method of Deformation of Functional'') that has the advantages at greater generality and flexibility as well as the ability to solve complex problems which other methods cannot solve.

(

**1020**views)

**Lectures on Optimization: Theory and Algorithms**

by

**John Cea**-

**Tata Institute of Fundamental Research**

Contents: Differential Calculus in Normed Linear Spaces; Minimization of Functionals; Minimization Without Constraints; Minimization with Constraints; Duality and Its Applications; Elements of the Theory of Control and Elements of Optimal Design.

(

**5955**views)

**Applied Mathematical Programming**

by

**S. Bradley, A. Hax, T. Magnanti**-

**Addison-Wesley**

This book shows you how to model a wide array of problems. Covered are topics such as linear programming, duality theory, sensitivity analysis, network/dynamic programming, integer programming, non-linear programming, and my favorite, etc.

(

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

(

**3855**views)