Articles liés à Convex Optimization: Algorithms and Complexity
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 89,46
EUR 4,60 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisRésultats de recherche pour Convex Optimization: Algorithms and Complexity
Image d'archives
Convex Optimization: Algorithms and Complexity (Foundations and Trends(r) in Machine Learning)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781601988607_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Convex Optimization
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-9781601988607
Quantité disponible : Plus de 20 disponibles
Image d'archives
Convex Optimization
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 IQ-9781601988607
Quantité disponible : 15 disponible(s)
Image d'archives
Convex Optimization: Algorithms and Complexity (Foundations and Trends(r) in Machine Learning)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9781601988607
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Convex Optimization : Algorithms and Complexity
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 25071652-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Convex Optimization : Algorithms and Complexity
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 25071652-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Convex Optimization : Algorithms and Complexity
Edité par
Now Publishers, 2015
ISBN 10 : 1601988605
ISBN 13 : 9781601988607
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 25071652
Quantité disponible : Plus de 20 disponibles
Image d'archives
Convex Optimization: Algorithms and Complexity
Edité par
now publishers Inc, 2015
ISBN 10 : 1601988605
ISBN 13 : 9781601988607
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 210. N° de réf. du vendeur C9781601988607
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Convex Optimization
Vendeur : Rarewaves USA, OSWEGO, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. 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. N° de réf. du vendeur LU-9781601988607
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Convex Optimization
Vendeur : Rarewaves USA United, OSWEGO, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. 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. N° de réf. du vendeur LU-9781601988607
Quantité disponible : Plus de 20 disponibles