Sparse Optimization Theory and Methods 1st Edition, Kindle Edition

★★★★☆ 4.0 149 Bewertungen

€21.76
Preis bei Onlinekauf
Kostenloser Versand 30 Tage kostenlose Rückgabe

Verkauft und versendet von castellidiario.com.ar
Wir bemühen uns, Ihnen genaue Produktinformationen anzuzeigen. Hersteller, Lieferanten und andere stellen die hier gezeigten Angaben bereit.
€21.76
Preis bei Onlinekauf
Kostenloser Versand 30 Tage kostenlose Rückgabe

Wie möchten Sie Ihren Artikel erhalten?
Die ersten 30 Tage sind kostenlos! Wählen Sie den Tarif an der Kasse.
Versand
Ankunft 24.11.
Kostenlos
Abholung
In der Nähe prüfen
Lieferung
Nicht verfügbar

Verkauft und versendet von castellidiario.com.ar
30 Tage kostenlose Rückgabe Details

Produktdetails

Artikelnummer 220814396 Erscheinungsdatum 2026/05/03 Listenpreis €21.76 Modellnummer 220814396
Kategorie

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 more

XRay Not Enabled
ISBN13 978-1351624145
Edition 1st
Language English
File size 16.1 MB
Page Flip Enabled
Publisher CRC Press
Word Wise Not Enabled
Print length 290 pages
Accessibility Learn more
Publication date July 4, 2018
Enhanced typesetting Enabled

Korrektur der Produktinformationen

Wenn Sie Unvollständigkeiten oder Fehler in den Produktinformationen auf dieser Seite bemerken, nutzen Sie bitte das Korrekturformular unten.

Korrekturanfrage

Kundenbewertungen

4 von 5
★★★★☆
149 Bewertungen | 61 Rezensionen
So wird die Artikelbewertung berechnet
Alle Bewertungen anzeigen
5 Sterne
75% (112)
4 Sterne
8% (12)
3 Sterne
4% (6)
2 Sterne
2% (3)
1 Stern
11% (16)
Sortieren nach

Für dieses Produkt liegen derzeit keine schriftlichen Bewertungen vor.