Zobacz książki o podobnej tematyce

Więcej informacji o Convex Analysis and Minimization Algorithms I

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 480 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Reference, information & interdisciplinary subjects Research & information: general Information theory

• Pełny tytuł: Convex Analysis and Minimization Algorithms I
• Podtytuł: Fundamentals
• Autor: Jean-Baptiste Hiriart-Urruty, Claude Lemarechal
• Język: Angielski
• Oprawa: Miękka
• Liczba stron: 418
• EAN: 9783642081613
• ISBN: 3642081614
• ID: 01653208
• Wydawca: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Waga: 612 g
• Wymiary: 233 × 157 × 23 mm
• Data wydania: 15. May 2011

Ulubione w innej kategorii

---

---

---