MM Optimization Algorithms (Hardcover)

Kenneth Lange

ISBN 10: 1611974399 / ISBN 13: 9781611974393

Published by Society for Industrial & Applied Mathematics,U.S., New York, 2016

About this Item

Hardcover. Offers an overview of the MM principle, a device for deriving optimization algorithms satisfying the ascent or descent property. These algorithms can:Separate the variables of a problem. Avoid large matrix inversions. Linearize a problem. Restore symmetry.Deal with equality and inequality constraints gracefully. Turn a non-differentiable problem into a smooth problem.The author: Presents the first extended treatment of MM algorithms, which are ideal for high-dimensional optimization problems in data mining, imaging, and genomics. Derives numerous algorithms from a broad diversity of application areas, with a particular emphasis on statistics, biology, and data mining.Summarizes a large amount of literature that has not reached book form before. Presents the first extended treatment of MM algorithms, which are ideal for high-dimensional optimization problems in data mining, imaging, and genomics. The author derives numerous algorithms from a broad diversity of application areas, with a particular emphasis on statistics, biology, and data mining. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9781611974393

Bibliographic Details

• Title: MM Optimization Algorithms (Hardcover)
• Publisher: Society for Industrial & Applied Mathematics,U.S., New York
• Publication Date: 2016
• Language: English
• ISBN 10: 1611974399
• ISBN 13: 9781611974393
• Binding: Hardcover
• Condition: new

About this title

Synopsis

MM Optimization Algorithms offers an overview of the MM principle, a device for deriving optimization algorithms satisfying the ascent or descent property. These algorithms can separate the variables of a problem, avoid large matrix inversions, linearize a problem, restore symmetry, deal with equality and inequality constraints gracefully, and turn a nondifferentiable problem into a smooth problem.

The author presents the first extended treatment of MM algorithms, which are ideal for high-dimensional optimization problems in data mining, imaging, and genomics; derives numerous algorithms from a broad diversity of application areas, with a particular emphasis on statistics, biology, and data mining; and summarizes a large amount of literature that has not reached book form before.

Audience: This book is intended for those interested in high-dimensional optimization. Background material on convexity and semidifferentiable functions is derived in a setting congenial to graduate students.

Contents: Chapter 1: Beginning Examples; Chapter 2: Convexity and Inequalities; Chapter 3: Nonsmooth Analysis; Chapter 4: Majorization and Minorization; Chapter 5: Proximal Algorithms; Chapter 6: Regression and Multivariate Analysis; Chapter 7: Convergence and Acceleration; Appendix A: Mathematical Background.

About the Author

Kenneth Lange is the Rosenfeld Professor of Computational Genetics at UCLA and a faculty member in the Departments of Biomathematics, Human Genetics, and Statistics. 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. He won the Snedecor Award from the Joint Statistical Societies in 1993 and gave a platform presentation at the 2015 International Congress of Mathematicians. His research interests include human genetics, population modeling, biomedical imaging, computational statistics, optimization theory, and applied stochastic processes. He has published four previous books, Mathematical and Statistical Methods for Genetic Analysis, Numerical Analysis for Statisticians, Applied Probability, and Optimization, all with Springer and all in second editions.