**Lectures on Optimization: Theory and Algorithms**

by John Cea

**Publisher**: Tata Institute of Fundamental Research 1978**ISBN/ASIN**: 3540088504**Number of pages**: 237

**Description**:

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

Download or read it online for free here:

**Download link**

(1.1MB, PDF)

## Similar books

**Iterative Methods for Optimization**

by

**C.T. Kelley**-

**Society for Industrial Mathematics**

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.

(

**5429**views)

**Applied Mathematical Programming Using Algebraic Systems**

by

**Bruce A. McCarl, Thomas H. Spreen**-

**Texas A&M University**

This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The text concentrates upon conceptual issues, problem formulation, computerized problem solution, and results interpretation.

(

**5752**views)

**Decision Making and Productivity Measurement**

by

**Dariush Khezrimotlagh**-

**arXiv**

I wrote this book as a self-teaching tool to assist every teacher, student, mathematician or non-mathematician, and to support their understanding of the elementary concepts on assessing the performance of a set of homogenous firms ...

(

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

(

**3326**views)