Libros importados con hasta 50% OFF + Envío Gratis a todo USA  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Proximal Algorithms: 3 (Foundations and Trends® in Optimization) (in English)
Type
Physical Book
Publisher
Year
2021
Language
English
Pages
130
Format
Paperback
Dimensions
23.4 x 15.6 x 0.7 cm
Weight
0.19 kg.
ISBN13
9781601987167

Proximal Algorithms: 3 (Foundations and Trends® in Optimization) (in English)

Neal Parikh (Author) · Stephen Boyd (Author) · Now Publishers · Paperback

Proximal Algorithms: 3 (Foundations and Trends® in Optimization) (in English) - Parikh, Neal ; Boyd, Stephen

Physical Book

$ 71.58

$ 85.00

You save: $ 13.42

16% discount
  • Condition: New
It will be shipped from our warehouse between Friday, June 07 and Monday, June 10.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "Proximal Algorithms: 3 (Foundations and Trends® in Optimization) (in English)"

Proximal Algorithms discusses proximal operators and proximal algorithms, and illustrates their applicability to standard and distributed convex optimization in general and many applications of recent interest in particular. 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. Proximal Algorithms discusses different interpretations of proximal operators and algorithms, looks at their connections to many other topics in optimization and applied mathematics, surveys some popular algorithms, and provides a large number of examples of proximal operators that commonly arise in practice.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews