A convex approach to blind deconvolution with diverse inputs. - Ali Ahmed 004; Augustin Cosse; Laurent Demanet (CAMSAP, 2015)

Rank-one matrix completion is solved by the sum-of-squares relaxation of order two. - Augustin Cosse; Laurent Demanet (CAMSAP, 2015)

Semidefinite programming relaxations for matrix completion, inverse scattering and blind deconvolution. - Augustin Cosse (2016)

From Blind deconvolution to Blind Super-Resolution through convex programming. - Augustin Cosse (CoRR, 2017)

Compressed Super-Resolution I: Maximal Rank Sum-of-Squares. - Augustin Cosse (CoRR, 2020)

Stable Rank-One Matrix Completion is Solved by the Level 2 Lasserre Relaxation. - Augustin Cosse; Laurent Demanet (Found. Comput. Math., 2021)

In the recovery of sparse vectors from quadratic measurements, the presence of linear terms breaks the square root bottleneck. - Augustin Cosse (CoRR, 2023)

Sparse recovery from quadratic equations, part II: hardness and incoherence. - Augustin Cosse (CoRR, 2024)