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
Applied Mathematical Programming Using Algebraic Systemsby 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.
(12339 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.
(15910 views)
Linear Programmingby 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.
(8000 views)
Optimization Models For Decision Makingby Katta G. Murty - Springer
This is a Junior level book on some versatile optimization models for decision making in common use. The aim of this book is to develop skills in mathematical modeling, and in algorithms and computational methods to solve and analyze these models.
(11278 views)