Convex Optimization

Algorithms and Complexity
1. Auflage 2015
ISBN: 978-1-60198-860-7
Verlag: Now Publishers

Buch, Englisch, Band 26, 144 Seiten, Format (B × H): 156 mm x 234 mm

Reihe: Foundations and Trends® in Machine Learning

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. It begins with the fundamental theory of black-box optimization and proceeds to guide the reader through recent advances in structural optimization and stochastic optimization. The presentation of black-box optimization, strongly influenced by the seminal book by Nesterov, includes the analysis of cutting plane methods, as well as (accelerated) gradient descent schemes. Special attention is also given to non-Euclidean settings (relevant algorithms include Frank-Wolfe, mirror descent, and dual averaging), and discussing their relevance in machine learning. The text provides a gentle introduction to structural optimization with FISTA (to optimize a sum of a smooth and a simple non-smooth term), saddle-point mirror prox (Nemirovski's alternative to Nesterov's smoothing), and a concise description of interior point methods. In stochastic optimization it discusses stochastic gradient descent, mini-batches, random coordinate descent, and sublinear algorithms. It also briefly touches upon convex relaxation of combinatorial problems and the use of randomness to round solutions, as well as random walks based methods.

Autoren/Hrsg.

Bubeck, Sébastien

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Maschinelles Lernen

Inhaltsverzeichnis

1: Introduction 2: Convex optimization infinite dimension 3: Dimension-free convex optimization 4: Almost dimension-free convex optimization in non-Euclidean spaces 5: Beyond the black-box model 6: Convex optimization and randomness. References