Expédition rapide et soignée depuis l`Angleterre - Délai de livraison: entre 10 et 20 jours ouvrés.
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Algorithms For Convex Optimization Format Broché - Livre Informatique
0 avis sur Algorithms For Convex Optimization Format Broché - Livre Informatique
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
-
Complete Book Of Celtic Music For Appalachian Dulcimer
Neuf dès 67,99 €
-
I Want To Spend The Rest Of My Life Everywhere, With Everyone, One To One, Always, Forever, Now
Occasion dès 96,88 €
-
Behind Bars: The Definitive Guide To Music Notation
Neuf dès 101,68 €
-
La Sante Interdite
1 avis
Occasion dès 54,53 €
-
Die Eulen Europas
Occasion dès 57,46 €
-
Last Time I Drew A Crowd: The Autobiography Of Jim Bentley
Occasion dès 60,00 €
-
Collection Entremets & Petits Gâteaux
1 avis
Occasion dès 90,00 €
-
Trinity: Le Secret Le Mieux Gardé
1 avis
Occasion dès 53,00 €
-
Catafalque
Neuf dès 86,94 €
-
Sf2a : Scientific Highlights 2004
Occasion dès 69,00 €
-
By Marc Pairon Art Deco Ceramics Made In Belgium: Charles Catteau
6 avis
Occasion dès 110,00 €
-
Theory Of Ordinary Differential Equations
Occasion dès 65,99 €
-
Nietzsche And Zen
Neuf dès 137,34 €
-
Edexcel A Level Mathematics Pure Mathema
Neuf dès 64,34 €
-
English Legal System Eighth Edition
Neuf dès 60,59 €
-
Song Book - Intégrale --- Chant, Guitare Ou Piano
Occasion dès 100,00 €
-
Turc Sans Peine Méthode Assimil
Occasion dès 60,25 €
-
Harald Szeemann
Neuf dès 87,99 €
-
Bilingue 2000 - Lexique Thématique De L'italien Contemporain, Lessico Tematico Del Francese Contemporaneo
2 avis
Occasion dès 58,05 €
-
The Work Of Hipgnosis -Walk Away Rene
1 avis
Occasion dès 71,99 €
Produits similaires
Présentation Algorithms For Convex Optimization Format Broché
- Livre Informatique
Résumé :
Algorithms for Convex Optimization are the workhorses of data-driven, technological advancements in machine learning and artificial intelligence. This concise, modern guide to deriving these algorithms is self-contained and accessible to advanced students, practitioners, and researchers in computer science, operations research, and data science.
Biographie:
Nisheeth K. Vishnoi is a Professor of Computer Science at Yale University. His research areas include theoretical computer science, optimization, and machine learning. He is a recipient of the Best Paper Award at IEEE FOCS in 2005, the IBM Research Pat Goldberg Memorial Award in 2006, the Indian National Science Academy Young Scientist Award in 2011, and the Best Paper award at ACM FAccT in 2019. He was elected an ACM Fellow in 2019. He obtained a bachelor degree in Computer Science and Engineering from IIT Bombay and a Ph.D. in Algorithms, Combinatorics and Optimization from Georgia Institute of Technology.
Sommaire:
1. Bridging continuous and discrete optimization; 2. Preliminaries; 3. Convexity; 4. Convex optimization and efficiency; 5. Duality and optimality; 6. Gradient descent; 7. Mirror descent and multiplicative weights update; 8. Accelerated gradient descent; 9. Newton's method; 10. An interior point method for linear programming; 11. Variants of the interior point method and self-concordance; 12. Ellipsoid method for linear programming; 13. Ellipsoid method for convex optimization.
Détails de conformité du produit
Personne responsable dans l'UE