Convex Analysis and Minimization Algorithms I Fundamentals

by Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

Part of the Grundlehren der mathematischen Wissenschaften Series

Convex Analysis and Minimization Algorithms I Fundamentals 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.

Convex Analysis and Minimization Algorithms I Fundamentals Press Reviews

From the reviews: ... The book is very well written, nicely illustrated, and clearly understandable even for senior undergraduate students of mathematics... Throughout the book, the authors carefully follow the recommendation by A. Einstein: 'Everything should be made as simple as possible, but not simpler.'

Book Information

ISBN: 9783540568506
Publication date: 14th October 1993
Author: Jean-Baptiste Hiriart-Urruty, Claude Lemarechal
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. K an imprint of Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Format: Hardback
Pagination: 418 pages
Categories: Calculus of variations, Applied mathematics,

About Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

More About Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

Share this book