Sparse Optimization Theory and Methods - Info and Reading Options
By Yun-Bin Zhao
"Sparse Optimization Theory and Methods" was published by Taylor & Francis Group in 2018 - Boca Raton, FL, it has 284 pages and the language of the book is English.
“Sparse Optimization Theory and Methods” Metadata:
- Title: ➤ Sparse Optimization Theory and Methods
- Author: Yun-Bin Zhao
- Language: English
- Number of Pages: 284
- Publisher: Taylor & Francis Group
- Publish Date: 2018
- Publish Location: Boca Raton, FL
“Sparse Optimization Theory and Methods” Subjects and Themes:
- Subjects: ➤ Mathematical optimization - Convex Optimization - Dantzig Selector - Data Reconstruction - L1-Minimization - Lasso - Linear Optimization - Null Space Property - Range Space Property - Sparse Representation - Sparse Signal Recovery - MATHEMATICS - Applied - Probability & Statistics - General - Optimisation mathématique
Edition Identifiers:
- The Open Library ID: OL29400971M - OL21340584W
- ISBN-13: 9781351624145
- All ISBNs: 9781351624145
AI-generated Review of “Sparse Optimization Theory and Methods”:
"Sparse Optimization Theory and Methods" Description:
Open Data:
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
Read “Sparse Optimization Theory and Methods”:
Read “Sparse Optimization Theory and Methods” by choosing from the options below.
Search for “Sparse Optimization Theory and Methods” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Sparse Optimization Theory and Methods” in Libraries Near You:
Read or borrow “Sparse Optimization Theory and Methods” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Sparse Optimization Theory and Methods” at a library near you.
Buy “Sparse Optimization Theory and Methods” online:
Shop for “Sparse Optimization Theory and Methods” on popular online marketplaces.
- Ebay: New and used books.