Articles liés à Proximal Algorithms
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 76,63
EUR 4,59 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisRésultats de recherche pour Proximal Algorithms
Image d'archives
Proximal Algorithms (Foundations and Trends(r) in Optimization)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781601987167_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Proximal Algorithms
impression à la demandeVendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9781601987167
Quantité disponible : Plus de 20 disponibles
Image d'archives
Proximal Algorithms
impression à la demandeVendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9781601987167
Quantité disponible : Plus de 20 disponibles
Image d'archives
Proximal Algorithms
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9781601987167
Quantité disponible : 10 disponible(s)
Image d'archives
Proximal Algorithms (Foundations and Trends(r) in Optimization)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9781601987167
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Proximal Algorithms
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. 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. N° de réf. du vendeur LU-9781601987167
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Proximal Algorithms
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 20882502-n
Quantité disponible : Plus de 20 disponibles
Image d'archives
Proximal Algorithms
Edité par
now publishers Inc, 2014
ISBN 10 : 1601987161
ISBN 13 : 9781601987167
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 221. N° de réf. du vendeur C9781601987167
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Proximal Algorithms
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 20882502-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Proximal algorithms
Edité par
Now Publishers Inc, 2013
ISBN 10 : 1601987161
ISBN 13 : 9781601987167
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Inhaltsverzeichnis1: Introduction 2: Properties 3: Interpretations 4: Proximal Algorithms 5: Parallel and Distributed Algorithms 6: Evaluating Proximal Operators 7: Examples and Applications. 8: Conclusions. Ackowledgments. Refe. N° de réf. du vendeur 4231641
Quantité disponible : Plus de 20 disponibles