Proximal Algorithms
Foundations and Trends® in Optimization · 13.01.2014 · 1 (3) · 127-239
DOI: 10.1561/2400000003 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends® in Optimization, online erschienen am 13.01.2014. Verfasst von Neal Parikh und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2830-mal zitiert (Crossref) und nennt 209 Literaturangaben.
Abstract (Originalsprache)
This monograph is about a class of optimization algorithms called proximal algorithms. Much like Newton’s method is a standard tool for solving unconstrained smooth optimization problems of modest size, proximal algorithms can be viewed as an analogous tool for nonsmooth, constrained, large-scale, or distributed versions of these problems. They are very generally applicable, but are especially well-suited to problems of substantial recent interest involving large or high-dimensional datasets. Proximal methods sit at a higher level of abstraction than classical algorithms like Newton’s method: the base operation is evaluating the proximal operator of a function, which itself involves solving a small convex optimization problem. These subproblems, which generalize the problem of projecting a point onto a convex set, often admit closed-form solutions or can be solved very quickly with standard or simple specialized methods. Here, we discuss the many different interpretations of proximal operators and algorithms, describe their connections to many other topics in optimization and applied mathematics, survey some popular algorithms, and provide a large number of examples of proximal operators that commonly arise in practice.
Zitieren
APA
Parikh, N., & Boyd, S. (2014). Proximal Algorithms. Foundations and Trends® in Optimization, 1(3), 127-239. https://doi.org/10.1561/2400000003
Vancouver
Parikh N, Boyd S. Proximal Algorithms. Foundations and Trends® in Optimization. 2014;1(3):127-239. doi:10.1561/2400000003
BibTeX
@article{Parikh2014,
author = {Parikh, Neal and Boyd, Stephen},
title = {Proximal Algorithms},
journal = {Foundations and Trends® in Optimization},
year = {2014},
volume = {1},
number = {3},
pages = {127--239},
doi = {10.1561/2400000003}
}
EUVIMED