Le livre est actuellement en rupture de stock
Paramètres
- 440pages
- 16 heures de lecture
En savoir plus sur le livre
The book presents convex analysis as an advanced extension of standard calculus, emphasizing inequalities over equalities, making it suitable for graduate studies. It highlights minimization algorithms tailored for non-differentiable functions, showcasing applications in optimization and operations research. The work is divided into two parts: the first serves as an introductory textbook for courses or self-study, while the second delves into advanced topics for specialists, compiling previously unpublished results.
Achat du livre
Convex Analysis and Minimization Algorithms I, Jean-Baptiste Hiriart-Urruty, Claude Lemarechal
- Langue
- Année de publication
- 2011
- product-detail.submit-box.info.binding
- (souple)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.
Modes de paiement
Personne n'a encore évalué .
- Titre
- Convex Analysis and Minimization Algorithms I
- Sous-titre
- Fundamentals
- Langue
- Anglais
- Éditeur
- Springer Berlin Heidelberg
- Publié
- 2011
- Format
- souple
- Pages
- 440
- ISBN13
- 9783642081613
- Séries
- Description
- The book presents convex analysis as an advanced extension of standard calculus, emphasizing inequalities over equalities, making it suitable for graduate studies. It highlights minimization algorithms tailored for non-differentiable functions, showcasing applications in optimization and operations research. The work is divided into two parts: the first serves as an introductory textbook for courses or self-study, while the second delves into advanced topics for specialists, compiling previously unpublished results.