Convex analysis and nonlinear optimization : theory and examples

Optimization is a rich and thriving mathematical discipline. The theory underlying current computational optimization techniques grows ever more sophisticated. The powerful and elegant language of convex analysis unifies much of this theory. The aim of this book is to provide a concise, accessible account of convex analysis and its applications and extensions, for a broad audience. It can serve as a teaching text, at roughly the level of first year graduate students. While the main body of the text is self-contained, each section concludes with an often extensive set of optional exercises. The new edition adds material on semismooth optimization, as well as several new proofs that will make this book even more self-contained.

Author Notes

Jonathan M. Borwein, FRSC is Canada Research Chair in Collaborative Technology at Dalhousie University
Adrian S. Lewis is a Professor in the School of Operations Research and Industrial Engineering at Cornell

Preface	p. vii
1 Background	p. 1
1.1 Euclidean Spaces	p. 1
1.2 Symmetric Matrices	p. 9
2 Inequality Constraints	p. 15
2.1 Optimality Conditions	p. 15
2.2 Theorems of the Alternative	p. 23
2.3 Max-functions	p. 28
3 Fenchel Duality	p. 33
3.1 Subgradients and Convex Functions	p. 33
3.2 The Value Function	p. 43
3.3 The Fenchel Conjugate	p. 49
4 Convex Analysis	p. 65
4.1 Continuity of Convex Functions	p. 65
4.2 Fenchel Biconjugation	p. 76
4.3 Lagrangian Duality	p. 88
5 Special Cases	p. 97
5.1 Polyhedral Convex Sets and Functions	p. 97
5.2 Functions of Eigenvalues	p. 104
5.3 Duality for Linear and Semidefinite Programming	p. 109
5.4 Convex Process Duality	p. 114
6 Nonsmooth Optimization	p. 123
6.1 Generalized Derivatives	p. 123
6.2 Regularity and Strict Differentiability	p. 130
6.3 Tangent Cones	p. 137
6.4 The Limiting Subdifferential	p. 145
7 Karush-Kuhn-Tucker Theory	p. 153
7.1 An Introduction to Metric Regularity	p. 153
7.2 The Karush-Kuhn-Tucker Theorem	p. 160
7.3 Metric Regularity and the Limiting Subdifferential	p. 166
7.4 Second Order Conditions	p. 172
8 Fixed Points	p. 179
8.1 The Brouwer Fixed Point Theorem	p. 179
8.2 Selection and the Kakutani-Fan Fixed Point Theorem	p. 190
8.3 Variational Inequalities	p. 200
9 More Nonsmooth Structure	p. 213
9.1 Rademacher's Theorem	p. 213
9.2 Proximal Normals and Chebyshev Sets	p. 218
9.3 Amenable Sets and Prox-Regularity	p. 228
9.4 Partly Smooth Sets	p. 233
10 Postscript: Infinite Versus Finite Dimensions	p. 239
10.1 Introduction	p. 239
10.2 Finite Dimensionality	p. 241
10.3 Counterexamples and Exercises	p. 244
10.4 Notes on Previous Chapters	p. 248
11 List of Results and Notation	p. 253
11.1 Named Results	p. 253
11.2 Notation	p. 267
Bibliography	p. 275
Index	p. 289

Available:*

On Order

Summary

Summary

Author Notes

Table of Contents