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 Applicationby 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.
(5815 views)
The Design of Approximation Algorithmsby D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(15925 views)
Lectures on Optimization: Theory and Algorithmsby 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.
(10778 views)
Convex Optimization: Algorithms and Complexityby 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.
(6257 views)