MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

Author(s)
Gamarnik, David; Misra, Sidhant
Thumbnail
DownloadGamarnik_A note on.pdf (285.3Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We consider the problem of reconstructing a low-rank matrix from a subset of its entries and analyze two variants of the so-called alternating minimization algorithm, which has been proposed in the past. We establish that when the underlying matrix has rank one, has positive bounded entries, and the graph underlying the revealed entries has diameter which is logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization. We further provide simulation results which suggest that the second variant which is based on the message passing type updates performs significantly better.
Date issued
2016-06
URI
http://hdl.handle.net/1721.1/109093
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Sloan School of Management
Journal
IEEE Signal Processing Letters
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Gamarnik, David and Misra, Sidhant. “A Note on Alternating Minimization Algorithm for the Matrix Completion Problem.” IEEE Signal Processing Letters 23, no. 10 (October 2016): 1340–1343. © 2016 Institute of Electrical and Electronics Engineers (IEEE)
Version: Original manuscript
ISSN
1070-9908
1558-2361

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.