Convex optimization theory
Bertsekas, Dimitri P.
Convex optimization theory - Hyderabad: University Press India, 2010. - xii, 407p.
Includes bibliographical reference and index.
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 functions in terms of points, and in terms of hyper planes. 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.
9788173717147
DUALITY THEORY (MATHEMATICS)
CONVEX FUNCTIONS
MATHEMATICAL OPTIMIZATION
CONVEX PROGRAMMING
514.17 / BER-C
Convex optimization theory - Hyderabad: University Press India, 2010. - xii, 407p.
Includes bibliographical reference and index.
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 functions in terms of points, and in terms of hyper planes. 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.
9788173717147
DUALITY THEORY (MATHEMATICS)
CONVEX FUNCTIONS
MATHEMATICAL OPTIMIZATION
CONVEX PROGRAMMING
514.17 / BER-C
