A. Cosse

activity

20172026

most citedFrom Blind deconvolution to Blind Super-Resolution through convex programming

3 citations · 6 across the 7 of their papers we have counts for

collaborators

Showing math.NAShow all

2 papers · 1 filter

math.NA2020

Compressed Super-Resolution I: Maximal Rank Sum-of-Squares

Augustin Cosse

Let $μ (t) = \sum_{τ \in S} α_{τ} δ (t - τ)$ denote an $∣ S ∣$ -atomic measure defined on $[0, 1]$ , satisfying $min_{τ \neq = τ^{'}} ∣ τ - τ^{'} ∣ \geq ∣ S ∣ \cdot n^{- 1}$ . Let $η(θ) = \sum_{τ\in S} a_τD_n(θ-…

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…