000 | a | ||
---|---|---|---|
999 |
_c31826 _d31826 |
||
008 | 230420b xxu||||| |||| 00| 0 eng d | ||
020 | _a9780367237745 | ||
082 |
_a516.362 _bKRA |
||
100 | _aKrantz, Steven G. | ||
245 | _aConvex analysis | ||
260 |
_bCRC Press, _aBoca Raton : _c2015 |
||
300 |
_axiii, 161 p. ; _bill., _c23 cm |
||
365 |
_b1995.00 _cINR _d01 |
||
490 | _aTextbooks in mathematics | ||
504 | _aIncludes bibliographical references and index. | ||
520 | _aConvexity is an ancient idea going back to Archimedes. Used sporadically in the mathematical literature over the centuries, today it is a flourishing area of research and a mathematical subject in its own right. Convexity is used in optimization theory, functional analysis, complex analysis, and other parts of mathematics.Convex Analysis introduces analytic tools for studying convexity and provides analytical applications of the concept. The book includes a general background on classical geometric theory which allows readers to obtain a glimpse of how modern mathematics is developed and how g. | ||
650 | _aConvex geometry | ||
650 | _aFunctional analysis | ||
650 | _aOperator theory | ||
650 | _aDiscrete geometry | ||
650 | _aConvex functions | ||
650 | _aBrunn-Minkowski inequality | ||
650 | _aDefining function | ||
650 | _aExhaustion function | ||
650 | _aFactorial function | ||
650 | _a Gamma function | ||
650 | _aHausdorff distance | ||
650 | _a Krein-Milman theorem | ||
650 | _aLinear programming | ||
650 | _aMini Max theorem | ||
650 | _aMinikowski functional | ||
650 | _aOrtho -convex set | ||
650 | _aSubharmonic functions | ||
650 | _aTargent directions | ||
650 | _aApproximation | ||
942 |
_2ddc _cBK |