Convex Analysis and Minimization Algorithms I : Fundamentals Paperback / softback
by Jean-Baptiste Hiriart-Urruty, Claude Lemarechal
Part of the Grundlehren der mathematischen Wissenschaften series
Paperback / softback
Description
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.
Information
-
Item not Available
- Format:Paperback / softback
- Pages:418 pages, XVIII, 418 p.
- Publisher:Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Publication Date:15/05/2011
- Category:
- ISBN:9783642081613
Other Formats
- Hardback from £109.99
- PDF from £101.58
Information
-
Item not Available
- Format:Paperback / softback
- Pages:418 pages, XVIII, 418 p.
- Publisher:Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Publication Date:15/05/2011
- Category:
- ISBN:9783642081613