Algorithms for Sparsity-Constrained Optimization

· Springer Theses Book 261 · Springer Science & Business Media
4.0
2 reviews
Ebook
107
Pages
Ratings and reviews aren’t verified  Learn More

About this ebook

This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a "greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models.

Ratings and reviews

4.0
2 reviews

About the author

Dr. Bahmani completed his thesis at Carnegie Mellon University and is currently employed by the Georgia Institute of Technology.

Rate this ebook

Tell us what you think.

Reading information

Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.