## 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 5

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

... 88 infinite-dimensional, 91, 249 Lagrangian, see Lagrangian duality LP, vii, 25,

109-113, 202 nonconvex, 93

**norm**, 117 process, 114-122 quadratic

programming, 205 SDP, vii, 109-113 strict-smooth, 78, 82 duality (cont.) weak

cone program ...

### What people are saying - Write a review

### Contents

Chapter 2 Inequality Constraints | 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 |