Logo

Convex Optimization: Algorithms and Complexity

Large book cover: Convex Optimization: Algorithms and Complexity

Convex Optimization: Algorithms and Complexity
by

Publisher: arXiv.org
Number of pages: 130

Description:
This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural optimization and stochastic optimization.

Home page url

Download or read it online for free here:
Download link
(1.1MB, PDF)

Similar books

Book cover: Robust OptimizationRobust Optimization
by - Princeton University Press
Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of this relatively new approach to optimization.
(6005 views)
Book cover: Universal Optimization and Its ApplicationUniversal Optimization and Its Application
by - 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.
(1997 views)
Book cover: Discrete OptimizationDiscrete Optimization
by - 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.
(4800 views)
Book cover: Linear ProgrammingLinear Programming
by - 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.
(3874 views)