Springer Theses

Algorithms for Sparsity-Constrained Optimization

Authors: Bahmani, Sohail

  • Nominated by Carnegie Mellon University as an outstanding Ph.D. thesis
  • Provides an new direction of research into problems of extracting structure from data
  • Advances the science of structure discovery through sparsity
see more benefits

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-319-01881-2
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $129.00
price for USA
  • ISBN 978-3-319-01880-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $129.00
price for USA
  • ISBN 978-3-319-37719-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
About this book

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.

About the authors

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

Table of contents (7 chapters)

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-319-01881-2
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $129.00
price for USA
  • ISBN 978-3-319-01880-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $129.00
price for USA
  • ISBN 978-3-319-37719-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Algorithms for Sparsity-Constrained Optimization
Authors
Series Title
Springer Theses
Series Volume
261
Copyright
2014
Publisher
Springer International Publishing
Copyright Holder
Springer International Publishing Switzerland
eBook ISBN
978-3-319-01881-2
DOI
10.1007/978-3-319-01881-2
Hardcover ISBN
978-3-319-01880-5
Softcover ISBN
978-3-319-37719-3
Series ISSN
2190-5053
Edition Number
1
Number of Pages
XXI, 107
Number of Illustrations and Tables
1 b/w illustrations, 12 illustrations in colour
Topics