Convex Analysis and Minimization Algorithms I : Fundamentals /
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, provid...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | 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: | Connect to the full text of this electronic book |
| Summary: | 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. |
|---|---|
| Item Description: | Electronic resource. |
| Physical Description: | 1 online resource (xvii, 420 pages) |
| ISBN: | 9783662027967 (electronic bk.) 3662027968 (electronic bk.) |
| ISSN: | 0072-7830 ; |