Convex Optimization: Algorithms and Complexity
by Sebastien Bubeck
Publisher: arXiv.org 2015
Number of pages: 130
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: