Sparse Optimization Theory and Methods

Nonfiction, Science & Nature, Mathematics, Arithmetic, Business & Finance, Management & Leadership, Operations Research, Economics, Statistics
Cover of the book Sparse Optimization Theory and Methods by Yun-Bin Zhao, CRC Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Yun-Bin Zhao ISBN: 9781351624145
Publisher: CRC Press Publication: July 4, 2018
Imprint: CRC Press Language: English
Author: Yun-Bin Zhao
ISBN: 9781351624145
Publisher: CRC Press
Publication: July 4, 2018
Imprint: CRC Press
Language: English

Seeking sparse solutions of underdetermined linear systems is required in many areas of engineering and science such as signal and image processing. The efficient sparse representation becomes central in various big or high-dimensional data processing, yielding fruitful theoretical and realistic results in these fields. The mathematical optimization plays a fundamentally important role in the development of these results and acts as the mainstream numerical algorithms for the sparsity-seeking problems arising from big-data processing, compressed sensing, statistical learning, computer vision, and so on. This has attracted the interest of many researchers at the interface of engineering, mathematics and computer science.

Sparse Optimization Theory and Methods presents the state of the art in theory and algorithms for signal recovery under the sparsity assumption. The up-to-date uniqueness conditions for the sparsest solution of underdertemined linear systems are described. The results for sparse signal recovery under the matrix property called range space property (RSP) are introduced, which is a deep and mild condition for the sparse signal to be recovered by convex optimization methods. This framework is generalized to 1-bit compressed sensing, leading to a novel sign recovery theory in this area. Two efficient sparsity-seeking algorithms, reweighted l1-minimization in primal space and the algorithm based on complementary slackness property, are presented. The theoretical efficiency of these algorithms is rigorously analysed in this book. Under the RSP assumption, the author also provides a novel and unified stability analysis for several popular optimization methods for sparse signal recovery, including l1-mininization, Dantzig selector and LASSO. This book incorporates recent development and the author’s latest research in the field that have not appeared in other books.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Seeking sparse solutions of underdetermined linear systems is required in many areas of engineering and science such as signal and image processing. The efficient sparse representation becomes central in various big or high-dimensional data processing, yielding fruitful theoretical and realistic results in these fields. The mathematical optimization plays a fundamentally important role in the development of these results and acts as the mainstream numerical algorithms for the sparsity-seeking problems arising from big-data processing, compressed sensing, statistical learning, computer vision, and so on. This has attracted the interest of many researchers at the interface of engineering, mathematics and computer science.

Sparse Optimization Theory and Methods presents the state of the art in theory and algorithms for signal recovery under the sparsity assumption. The up-to-date uniqueness conditions for the sparsest solution of underdertemined linear systems are described. The results for sparse signal recovery under the matrix property called range space property (RSP) are introduced, which is a deep and mild condition for the sparse signal to be recovered by convex optimization methods. This framework is generalized to 1-bit compressed sensing, leading to a novel sign recovery theory in this area. Two efficient sparsity-seeking algorithms, reweighted l1-minimization in primal space and the algorithm based on complementary slackness property, are presented. The theoretical efficiency of these algorithms is rigorously analysed in this book. Under the RSP assumption, the author also provides a novel and unified stability analysis for several popular optimization methods for sparse signal recovery, including l1-mininization, Dantzig selector and LASSO. This book incorporates recent development and the author’s latest research in the field that have not appeared in other books.

More books from CRC Press

Cover of the book Handbook of Advanced Industrial and Hazardous Wastes Management by Yun-Bin Zhao
Cover of the book A Mathematica Primer for Physicists by Yun-Bin Zhao
Cover of the book Handbook of Approximation Algorithms and Metaheuristics by Yun-Bin Zhao
Cover of the book Fundamentals of Environmental Discharge Modeling by Yun-Bin Zhao
Cover of the book A Socio-cultural Perspective on Patient Safety by Yun-Bin Zhao
Cover of the book Photovoltaic Engineering Handbook by Yun-Bin Zhao
Cover of the book Statistical Evidence by Yun-Bin Zhao
Cover of the book Poverty and Child Health by Yun-Bin Zhao
Cover of the book Medical Big Data and Internet of Medical Things by Yun-Bin Zhao
Cover of the book Precision Photoshop by Yun-Bin Zhao
Cover of the book Steroid Biochemistry by Yun-Bin Zhao
Cover of the book Computational Context by Yun-Bin Zhao
Cover of the book Additive Manufacturing by Yun-Bin Zhao
Cover of the book Basic Motorsport Engineering by Yun-Bin Zhao
Cover of the book Clinical Guide to Popular Diets by Yun-Bin Zhao
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy