You might also like

More about Convex Analysis and Minimization Algorithms I

• Book details
• Synopsis
• Trending among others

You get 349 loyalty points

Book synopsis

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.

Book details

Book category Books in English Reference, information & interdisciplinary subjects Research & information: general Information theory

• Full title: Convex Analysis and Minimization Algorithms I
• Subtitle: Fundamentals
• Author: Jean-Baptiste Hiriart-Urruty, Claude Lemarechal
• Language: English
• Binding: Paperback
• Number of pages: 418
• EAN: 9783642081613
• ISBN: 3642081614
• ID: 01653208
• Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Weight: 612 g
• Dimensions: 233 × 157 × 23 mm
• Date of publishing: 15. May 2011

Trending among others

---

---

---