Item added to cart
Optimization is a rich and thriving mathematical discipline, and the underlying theory of current computational optimization techniques grows ever more sophisticated. This book aims to provide a concise, accessible account of convex analysis and its applications and extensions, for a broad audience. Each section concludes with an often extensive set of optional exercises. This new edition adds material on semismooth optimization, as well as several new proofs.
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.
Background.- Inequality constraints.- Fenchel duality.- Convex analysis.- Special cases.- Nonsmooth optimization.- The Karush-Kuhn-Tucker Theorem.- Fixed points.- Postscript: infinite versus finite dimensions.- List of results and notation.From the reviews:
MATHEMATICAL REVIEWS
The present book gives a concise treatment of the area, aiming to show the relevance in particular of new developments in nonsmooth analysis to optimization theory&The book is of a manageable size and as such should appeal to the student. Further, the proofs are generally short and snappy, revealing the power of the abstract structural approach and fruitful interplay of geometrical and topological ideas. However, considerable ground ilă•
Copyright © 2018 - 2024 ShopSpell