**Convex Optimization: Algorithms and Complexity**

by Sebastien Bubeck

**Publisher**: arXiv.org 2015**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.

Download or read it online for free here:

**Download link**

(1.1MB, PDF)

## Similar books

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

(

**9425**views)

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

(

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

(

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

(

**8368**views)