Convex Analysis
Edition: 10th printing, 1st paperback printing
Series: Princeton Landmarks in Mathematics
Publisher: Princeton University Press
Published: 1997
Place of publication: Princeton, NJ, USA
Language: eng
Format: Paperback
Number of pages: 469
ISBN-13: 9780691015866
Copyright date: 1970
Subjects: Functional analysis; Science/Mathematics; Nonlinear Programming; Optimization (Mathematical Theory); Mathematics; Advanced; Mathematical Analysis; Mathematics / Advanced; Linear Programming
First sentence: Throughout this book, R denotes the real number system, and Rn is the usual vector space of real n-tuples x = ( 1,..., n).
Description: Available for the first time in paperback, R. Tyrrell Rockafellar's classic study presents readers with a coherent branch of nonlinear mathematical analysis that is especially suited to the study of optimization problems. Rockafellar's theory differs from classical analysis in that differentiability assumptions are replaced by convexity assumptions. The topics treated in this volume include: systems of inequalities, the minimum or maximum of a convex function over a convex set, Lagrange multipliers, minimax theorems and duality, as well as basic results about the structure of convex sets and the continuity and differentiability of convex functions and saddle- functions.

This book has firmly established a new and vital area not only for pure mathematics but also for applications to economics and engineering. A sound knowledge of linear algebra and introductory real analysis should provide readers with sufficient background for this book. There is also a guide for the reader who may be using the book as an introduction, indicating which parts are essential and which may be skipped on a first reading.
--back cover
Table of contents: title: 1. Affine Sets --; title: 2. Convex Sets and Cones --; title: 3. The Algebra of Convex Sets --; title: 4. Convex Functions --; title: 5. Functional Operations --; title: 6. Relative Interiors of Convex Sets --; title: 7. Closures of Convex Functions --; title: 8. Recession Cones and Unboundedness --; title: 9. Some Closedness Criteria --; title: 10. Continuity of Convex Functions --; title: 11. Separation Theorems --; title: 12. Conjugates of Convex Functions --; title: 13. Support Functions --; title: 14. Polars of Convex Sets --; title: 15. Polars of Convex Functions --; title: 16. Dual Operations --; title: 17. Caratheodory's Theorem --; title: 18. Extreme Points and Faces of Convex Sets --; title: 19. Polyhedral Convex Sets and Functions --; title: 20. Some Applications of Polyhedral Convexity --; title: 21. Helly's Theorem and Systems of Inequalities --; title: 22. Linear Inequalities --; title: 23. Directional Derivatives and Subgradients --; title: 24. Differential Continuity and Monotonicity --; title: 25. Differentiability of Convex Functions --; title: 26. The Legendre Transformation --; title: 27. The Minimum of a Convex Function 28. Ordinary Convex Programs and Lagrange Multipliers --; title: 29. Bifunctions and Generalized Convex Programs --; title: 30. Adjoint Bifunctions and Dual Programs --; title: 31. Fenchel's Duality Theorem --; title: 32. The Maximum of a Convex Function --; title: 33. Saddle-Functions --; title: 34. Closures and Equivalence Classes --; title: 35. Continuity and Differentiability of Saddle-functions --; title: 36. Minimax Problems --; title: 37. Conjugate Saddle-functions and Minimax Theorems --; title: 38. The Algebra of Bifunctions --; title: 39. Convex Processes.