000			01424nam a22002417a 4500
003			OSt
005			20240418164759.0
008			240418b |||||||| |||| 00| 0 hin d
020			_a9788173717147
040			_aNISER LIBRARY _bEnglish _cNISER LIBRARY
082			_a514.17 _bBER-C
100			_aBertsekas, Dimitri P.
245			_aConvex optimization theory
260			_aHyderabad: _bUniversity Press India, _c2010.
300			_axii, 407p.
504			_aIncludes bibliographical reference and index.
520			_aAn 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.
650			_aDUALITY THEORY (MATHEMATICS)
650			_aCONVEX FUNCTIONS
650			_aMATHEMATICAL OPTIMIZATION
650			_aCONVEX PROGRAMMING
942			_2udc _cN
999			_c34859 _d34859