An insightful, concise, and rigorous treatment of the basic theory of convex sets and functions in finite dimensions, and the analytical/geometrical foundations of convex optimization and duality theory. Convexity theory is first developed in a simple accessible manner, using easily visualized proofs. Then the focus shifts to a transparent geometrical line of analysis to develop the fundamental duality between descriptions of convex sets and functions in terms of points and in terms of hyperplanes. Finally, convexity theory and abstract duality are applied to problems of constrained optimization, Fenchel and conic duality, and game theory to develop the sharpest possible duality results within a highly visual geometric framework. The book may be used as a text for a theoretical convex optimization course; the author has taught several variants of such a course at MIT and elsewhere over the last ten years. It may also be used as a supplementary source for nonlinear programming classes, and as a theoretical foundation for classes focused on convex optimization models (rather than theory). It is an ideal companion to the books Convex Optimization Algorithms, and Nonlinear Programming by the same author.ASIN: 1886529310VSKU: GBV.1886529310.ACondition: AcceptableAuthor/Artist:Bertsekas, Dimitri P.Binding: HardcoverNote: Any images shown are stock photographs and product may differ from what is shown. Condition Notes: This book is in acceptable condition and may have highlighting and or writing throughout. The actual cover image may not match the stock photo, dust jacket may be damaged or missing. Book may show internal and or external wear on spine or cover and may be slightly skewed or have creased pages. This is a used book so codes may be invalid or accompanying media may be missing. May be an Ex library book with stickers and stamps.
Related
Related
Related
Related