Knihu momentálně nemáme skladem
Parametry
- 440 stránek
- 16 hodin čtení
Více o knize
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.
Nákup knihy
Convex Analysis and Minimization Algorithms I, Jean-Baptiste Hiriart-Urruty, Claude Lemarechal
- Jazyk
- Rok vydání
- 2011
- product-detail.submit-box.info.binding
- (měkká)
Jakmile se objeví, pošleme e-mail.
Doručení
Platební metody
Nikdo zatím neohodnotil.
- Titul
- Convex Analysis and Minimization Algorithms I
- Podtitul
- Fundamentals
- Jazyk
- anglicky
- Vydavatel
- Springer Berlin Heidelberg
- Rok vydání
- 2011
- Vazba
- měkká
- Počet stran
- 440
- ISBN13
- 9783642081613
- Série
- Anotace
- 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.