Bültmann & Gerriets
Optimization
von Kenneth Lange
Verlag: Springer New York
Reihe: Springer Texts in Statistics Nr. 95
Hardcover
ISBN: 978-1-4899-9270-3
Auflage: 2nd ed. 2013
Erschienen am 03.04.2015
Sprache: Englisch
Format: 235 mm [H] x 155 mm [B] x 30 mm [T]
Gewicht: 820 Gramm
Umfang: 548 Seiten

Preis: 123,04 €
keine Versandkosten (Inland)


Dieser Titel wird erst bei Bestellung gedruckt. Eintreffen bei uns daher ca. am 30. Oktober.

Der Versand innerhalb der Stadt erfolgt in Regel am gleichen Tag.
Der Versand nach außerhalb dauert mit Post/DHL meistens 1-2 Tage.

klimaneutral
Der Verlag produziert nach eigener Angabe noch nicht klimaneutral bzw. kompensiert die CO2-Emissionen aus der Produktion nicht. Daher übernehmen wir diese Kompensation durch finanzielle Förderung entsprechender Projekte. Mehr Details finden Sie in unserer Klimabilanz.
Klappentext
Inhaltsverzeichnis
Biografische Anmerkung

Finite-dimensional optimization problems occur throughout the mathematical sciences. The majority of these problems cannot be solved analytically. 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. Its stress on statistical applications will be especially appealing to graduate students of statistics and biostatistics. The intended audience also includes students in applied mathematics, computational biology, computer science, economics, and physics who want to see rigorous mathematics combined with real applications.
In this second edition the emphasis remains on finite-dimensional optimization. New material has been added on the MM algorithm, block descent and ascent, and the calculus of variations. Convex calculus is now treated in much greater depth.  Advanced topics such as the Fenchel conjugate, subdifferentials, duality, feasibility, alternating projections, projected gradient methods, exact penalty methods, and Bregman iteration will equip students with the essentials for understanding modern data mining techniques in high dimensions.
 



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.



Kenneth Lange is the Rosenfeld Professor of Computational Genetics at UCLA. He is also Chair of the Department of Human Genetics and Professor of Biomathematics and Statistics. At various times during his career, he has held appointments at the University of New Hampshire, MIT, Harvard, the University of Michigan, the University of Helsinki, and Stanford. He is a fellow of the American Statistical Association, the Institute of Mathematical Statistics, and the American Institute for Medical and Biomedical Engineering. His research interests include human genetics, population modeling, biomedical imaging, computational statistics, and applied stochastic processes. Springer previously published his books
Mathematical and Statistical Methods for Genetic Analysis
,
Numerical Analysis for Statisticians
, and
Applied Probability
, all in second editions.


andere Formate
weitere Titel der Reihe