Kenneth Lange

Optimization (eBook, PDF)

• Format: PDF

Produktbeschreibung

This introduction to optimization attempts to strike a balance between presentation of mathematical theory and development of numerical algorithms. Building on students' skills in calculus and linear algebra, the text provides a rigorous exposition without undue abstraction and can serve as a bridge to more advanced treatises on nonlinear and convex programming. The emphasis on statistical applications will be especially appealing to graduate students of statistics and biostatistics. The intended audience also includes graduate students in applied mathematics, computational biology, computer science, economics, and physics as well as upper division undergraduate majors in mathematics who want to see rigorous mathematics combined with real applications.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer New York
• Seitenzahl: 255
• Erscheinungstermin: 9. März 2013
• Englisch
• ISBN-13: 9781475741827
• Artikelnr.: 44045559

Autorenporträt

Kenneth Lange is the Rosenfeld Professor of Computational Genetics in the Departments of Computational Medicine, Human Genetics, and Statistics at the University of California, Los Angeles. He served as chair of the UCLA Department of Computational Medicine for 9 years and as chair of the UCLA Department of Human Genetics for 12 years. He has authored five other books, including Mathematical and Statistical Methods for Genetic Analysis (Springer, 2002), Numerical Analysis for Statisticians (Springer, 2010) and Optimization (Springer, 2013). In 2021 he was elected to the National Academy of Sciences.

Inhaltsangabe

Elementary Optimization.- The Seven C's of Analysis.- The Gauge Integral.- Differentiation.- Karush-Kuhn-Tucker Theory.- Convexity.- Block Relaxation.- The MM Algorithm.- The EM Algorithm.- Newton's Method and Scoring.- Conjugate Gradient and Quasi-Newton.- Analysis of Convergence.- Penalty and Barrier Methods.- Convex Calculus.- Feasibility and Duality.- Convex Minimization Algorithms.- The Calculus of Variations.- Appendix: Mathematical Notes.- References.- Index.