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

**Robust Optimization**

by

**A. Ben-Tal, L. El Ghaoui, A. Nemirovski**-

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

(

**11093**views)

**Optimal Stopping and Applications**

by

**Thomas S. Ferguson**-

**UCLA**

From the table of contents: Stopping Rule Problems; Finite Horizon Problems; The Existence of Optimal Rules; Applications. Markov Models; Monotone Stopping Rule Problems; Maximizing the Rate of Return; Bandit Problems; Solutions to the Exercises.

(

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

(

**9299**views)

**Optimization Algorithms on Matrix Manifolds**

by

**P.-A. Absil, R. Mahony, R. Sepulchre**-

**Princeton University Press**

Many science and engineering problems can be rephrased as optimization problems on matrix search spaces endowed with a manifold structure. This book shows how to exploit the structure of such problems to develop efficient numerical algorithms.

(

**18186**views)