000 | 00855nam a22002297a 4500 | ||
---|---|---|---|
999 |
_c4476 _d4476 |
||
003 | OSt | ||
005 | 20180604140904.0 | ||
008 | 170727b xxu||||| |||| 00| 0 eng d | ||
020 | _a9788181285096 | ||
040 | _aSOTL | ||
041 | _aEnglish | ||
082 |
_a519.6 _bLAN |
||
100 | _aLange, Kenneth | ||
245 | _aOptimization | ||
250 | _a1st ed. | ||
260 |
_aNew Delhi: _bSpringer, _c2010. |
||
300 |
_axiii;252p. _bPAPER BACK _c23cm. |
||
500 | _aMathematics | ||
505 | _aCONTENTS Preface 1. Elementary Optimization 2. The seven c's of analysis 3. Differentiation 4. Karush-Kuhn-Tucker theory 5. Convexity 6. The MM Algorithm 7. The EM Algorithm 8. Newton's method 9. Conjugate Gradient and Quasi-Newton 10. Analysis of convergence 11. Convex Programming Appendix References Index | ||
520 | _aOptimization | ||
653 | _aMathematics |