Convex Analysis and Minimization Algorithms I: Fundamentals
Saved in:
Bibliographic Details
Main Author: Hiriart-Urruty, Jean-Baptiste (Author)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1993
Series:Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics 305
Subjects:
Online Access:Volltext
Item 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
Physical Description:1 Online-Ressource (XVIII, 418 p)
ISBN:9783662027967
9783642081613
ISSN:0072-7830
DOI:10.1007/978-3-662-02796-7

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text