Skip to main content Accessibility help
Internet Explorer 11 is being discontinued by Microsoft in August 2021. If you have difficulties viewing the site on Internet Explorer 11 we recommend using a different browser such as Microsoft Edge, Google Chrome, Apple Safari or Mozilla Firefox.
Home
> Subjects
> High-Dimensional Data Analysis with Low-Dimensional Models
> Convex Methods for Low-Rank…

High-Dimensional Data Analysis with Low-Dimensional Models Principles, Computation, and Applications

Prev

Chapter 4: Convex Methods for Low-Rank Matrix Recovery

Next

Chapter 4: Convex Methods for Low-Rank Matrix Recovery

pp. 132-190

Authors

John Wright
, Columbia University, New York,
Yi Ma
, University of California, Berkeley
Resources available Unlock the full potential of this textbook with additional resources. There are Instructor restricted resources available for this textbook. Explore resources
  • Add bookmark
  • Cite
  • Share

Summary

In this chapter, we will branch out from sparse signals to a broader class of models: the low-rank matrices. Similar to the problem of recovering sparse signals, we consider how to recover a matrix

About the book

Access options

Review the options below to login to check your access.

Purchase options

eTextbook
US$89.00
Hardback
US$89.00

Have an access code?

To redeem an access code, please log in with your personal login.

Log in

If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.

Also available to purchase from these educational ebook suppliers