Convex Optimization: Algorithms and Complexity
Foundations and Trends® in Machine Learning · 12.11.2015 · 8 (3-4) · 231-357
DOI: 10.1561/2200000050 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends® in Machine Learning, online erschienen am 12.11.2015. Verfasst von Sébastien Bubeck. Die Arbeit wurde bisher 1001-mal zitiert (Crossref) und nennt 89 Literaturangaben.
Abstract (Originalsprache)
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. Our presentation of black-box optimization, strongly influenced by Nesterov’s seminal book and Nemirovski’s lecture notes, includes the analysis of cutting plane methods, as well as (accelerated) gradient descent schemes. We also pay special attention to non-Euclidean settings (relevant algorithms include Frank-Wolfe, mirror descent, and dual averaging) and discuss their relevance in machine learning. We provide 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 we discuss stochastic gradient descent, minibatches, random coordinate descent, and sublinear algorithms. We also briefly touch upon convex relaxation of combinatorial problems and the use of randomness to round solutions, as well as random walks based methods.
Zitieren
APA
Bubeck, S. (2015). Convex Optimization: Algorithms and Complexity. Foundations and Trends® in Machine Learning, 8(3-4), 231-357. https://doi.org/10.1561/2200000050
Vancouver
Bubeck S. Convex Optimization: Algorithms and Complexity. Foundations and Trends® in Machine Learning. 2015;8(3-4):231-357. doi:10.1561/2200000050
BibTeX
@article{Bubeck2015,
author = {Bubeck, Sébastien},
title = {Convex Optimization: Algorithms and Complexity},
journal = {Foundations and Trends® in Machine Learning},
year = {2015},
volume = {8},
number = {3-4},
pages = {231--357},
doi = {10.1561/2200000050}
}
EUVIMED