Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Optimization

Optimization
Catalogue Information
Field name Details
Dewey Class 519.5
Title Optimization ([Ebook]) / by Kenneth Lange.
Author Lange, Kenneth
Other name(s) SpringerLink (Online service)
Edition statement 2nd ed. 2013.
Publication New York, NY : Springer
, 2013.
Physical Details XVII, 529 pages : 19 illus., 3 illus. in color. : online resource.
Series Springer Texts in Statistics 1431-875X ; ; 95
ISBN 9781461458388
Summary Note 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.:
Contents note 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.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users).
Internet Site http://dx.doi.org/10.1007/978-1-4614-5838-8
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 28954 Beginning of record . Catalogue Information 28954 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating28954
Quick Search