Convex Analysis and Minimization Algorithms I
Kurzinformation
inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar

Beschreibung
Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.
Produktdetails
So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
- hardcover
- 328 Seiten
- Erschienen 1998
- Springer
- Gebunden
- 604 Seiten
- Erschienen 1997
- Springer
- hardcover
- 310 Seiten
- Erschienen 1995
- Springer
- paperback
- 256 Seiten
- Erschienen 2025
- Birkhäuser
- paperback
- 808 Seiten
- Erschienen 2009
- Springer
- hardcover
- 241 Seiten
- Erschienen 1998
- Springer
- paperback
- 278 Seiten
- Erschienen 1997
- American Mathematical Society
- paperback
- 830 Seiten
- Erschienen 2005
- Springer
- paperback
- 252 Seiten
- Erschienen 2021
- Springer
- hardcover
- 462 Seiten
- Erschienen 2013
- De Gruyter
- Gebunden
- 604 Seiten
- Erschienen 2012
- Springer




