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...

Full description

Bibliographic Details
Main Authors: Hiriart-Urruty, Jean-Baptiste, Lemarechal, Claude (Author)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1993, 1993
Edition:1st ed. 1993
Series:Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03033nmm a2200409 u 4500
001 EB000686028
003 EBX01000000000000000539110
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783662027967 
100 1 |a Hiriart-Urruty, Jean-Baptiste 
245 0 0 |a Convex Analysis and Minimization Algorithms I  |h Elektronische Ressource  |b Fundamentals  |c by Jean-Baptiste Hiriart-Urruty, Claude Lemarechal 
250 |a 1st ed. 1993 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1993, 1993 
300 |a XVIII, 418 p  |b online resource 
505 0 |a Table of Contents Part I -- I. Convex Functions of One Real Variable -- II. Introduction to Optimization Algorithms -- III. Convex Sets -- IV. Convex Functions of Several Variables -- V. Sublinearity and Support Functions -- VI. Subdifferentials of Finite Convex Functions -- VII. Constrained Convex Minimization Problems: Minimality Conditions, Elements of Duality Theory -- VIII. Descent Theory for Convex Minimization: The Case of Complete Information -- Appendix: Notations -- 1 Some Facts About Optimization -- 2 The Set of Extended Real Numbers -- 3 Linear and Bilinear Algebra -- 4 Differentiation in a Euclidean Space -- 5 Set-Valued Analysis -- 6 A Bird’s Eye View of Measure Theory and Integration -- Bibliographical Comments -- References 
653 |a Operations Research, Management Science 
653 |a Operations research 
653 |a Management science 
653 |a Calculus of Variations and Optimization 
653 |a Control theory 
653 |a Systems Theory, Control 
653 |a System theory 
653 |a Applications of Mathematics 
653 |a Mathematics 
653 |a Mathematical optimization 
653 |a Calculus of variations 
700 1 |a Lemarechal, Claude  |e [author] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics 
028 5 0 |a 10.1007/978-3-662-02796-7 
856 4 0 |u https://doi.org/10.1007/978-3-662-02796-7?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 515.64 
082 0 |a 519.6 
520 |a 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