A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE signal processing letters Ročník 23; číslo 10; s. 1340 - 1343
Hlavní autoři:	Gamarnik, David, Misra, Sidhant
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.10.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) IEEE Signal Processing Society
Témata:	Algorithms Alternating minimization Approximation algorithms Belief propagation compressive sensing Computer simulation Graphs low-rank matrix completion Mathematics MATHEMATICS AND COMPUTING Message passing Minimization Optimization Polynomials Signal processing Signal processing algorithms Simulation
ISSN:	1070-9908, 1558-2361
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!