Convex Optimization: Algorithms and Complexity

Large book cover: Convex Optimization: Algorithms and Complexity

Convex Optimization: Algorithms and Complexity

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

Home page url

Download or read it online for free here:
Download link
(1.1MB, PDF)

Similar books

Book cover: Optimal Stopping and ApplicationsOptimal Stopping and Applications
by - 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.
Book cover: Discrete OptimizationDiscrete Optimization
by - 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.
Book cover: Lectures on Optimization: Theory and AlgorithmsLectures on Optimization: Theory and Algorithms
by - Tata Institute of Fundamental Research
Contents: Differential Calculus in Normed Linear Spaces; Minimization of Functionals; Minimization Without Constraints; Minimization with Constraints; Duality and Its Applications; Elements of the Theory of Control and Elements of Optimal Design.
Book cover: A Practical Guide to Robust OptimizationA Practical Guide to Robust Optimization
by - arXiv
The aim of this paper is to help practitioners to understand robust optimization and to successfully apply it in practice. We provide a brief introduction to robust optimization, and also describe important do's and don'ts for using it in practice.