## Convex Analysis and Nonlinear Optimization: Theory and ExamplesOptimization 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. |

### From inside the book

Results 1-5 of 41

The interior of D is just the largest open set contained in D, while cl D is the smallest closed set containing D. Finally, a

**subset**G of D is open in D if ...

... f(a) = |a| – y|*/2 is strictly convex on E for any point y in E. (c) Suppose C is a nonempty, closed convex

**subset**of E. (i) If y is any point in E, ...

(Carathéodory's theorem [52]) Suppose {a i e I} is a finite set of points in E. For any

**subset**J of I, define the cone C.J = { XLua' fe J 0 < n e R.

You have reached your viewing limit for this book.

### What people are saying - Write a review

### Contents

1 | |

15 | |

Chapter 3 Fenchel Duality
| 33 |

Chapter 4 Convex Analysis
| 65 |

Chapter 5 Special Cases
| 97 |

Chapter 6 Nonsmooth Optimization
| 123 |

Chapter 7 KarushKuhnTucker Theory
| 153 |

Chapter 8 Fixed Points
| 179 |

Chapter 9 More N onsmooth Structure
| 213 |

Infinite Versus Finite Dimensions
| 239 |

Chapter 11 List of Results and Notation
| 253 |

Bibliography | 275 |

Index | 289 |

### Other editions - View all

Convex Analysis and Nonlinear Optimization: Theory and Examples Jonathan M. Borwein,Adrian S. Lewis No preview available - 2000 |