3 citations · 6 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.NA2017★ 3 cited
Stable rank one matrix completion is solved by two rounds of semidefinite programming relaxation
Augustin Cosse, Laurent Demanet
This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear…
cs.IT2017★ 3 cited
From Blind deconvolution to Blind Super-Resolution through convex programming
Augustin Cosse
This paper discusses the recovery of an unknown signal through the result of its convolution with an unknown filter . This problem, also kno…