Skip to main content
Book cover

Algorithms for Sparsity-Constrained Optimization

  • Book
  • © 2014

Overview

  • 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
  • Includes supplementary material: sn.pub/extras

Part of the book series: Springer Theses (Springer Theses, volume 261)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

Keywords

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.

Authors and Affiliations

  • Carnegie Mellon University, Pittsburgh, USA

    Sohail Bahmani

About the author

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

Bibliographic Information

Publish with us