Navigation

Sandsynlighedsregning og statistik

Sparse Optimization Theory and Methods

Udgivet af Taylor & Francis Ltd

Bogdetaljer

  • Hæftet
  • 284 sider
  • Engelsk
ISBN 9780367781101
Om denne bog

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…

Se alle bogdetaljer →
Prissammenligning

Ingen boghandelspriser listet endnu

Denne titel er i vores bogkatalog. Butikstilbud vises her, når de er tilgængelige.

Betroet sælger:

Ingen boghandelstilbud lige nu.

Søg efter ISBN
Opdateret i dag

Boghandelspriser

Boghandel Titel Format ISBN Pris Lagerstatus Levering

Ingen boghandelstilbud endnu

Vi har titlen i kataloget. Priser vises her, når boghandlere lister den.

0.0
0 anmeldelser
5
0
4
0
3
0
2
0
1
0
0%
Anbefaler
0
Verificeret
Alle anmeldelser (0)

Ingen anmeldelser endnu

Skriv en anmeldelse

Valgfri - Kun brugt til verifikation
0 / 5000 tegn
Bogdetaljer
Forfatter Yun-Bin Zhao
Forlag Taylor & Francis Ltd
Kategori Sandsynlighedsregning og statistik
ISBN-13 9780367781101
EAN 9780367781101
Format Hæftet
Sprog Engelsk
sider 284
Produktbeskrivelse
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 authors latest research in the field that have not appeared in other books.

Prishistorik

Indlæser prishistorik...

Få prisalarm

Bliv underrettet, når prisen falder til dit ønskede beløb.