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
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.
(5679 views)
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.
(5679 views)
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.
(5746 views)
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.
(5746 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.
(7946 views)
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.
(7946 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.
(6159 views)
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.
(6159 views)