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
Optimal Stopping and Applicationsby 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.
(7226 views)
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.
(6506 views)
Universal Optimization and Its Applicationby Alexander Bolonkin - 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.
(1132 views)
An Introduction to Nonlinear Optimization Theoryby Marius Durea, Radu Strugariu - De Gruyter Open
Starting with the case of differentiable data and the classical results on constrained optimization problems, continuing with the topic of nonsmooth objects involved in optimization, the book concentrates on both theoretical and practical aspects.
(2158 views)