Completion of matrices with low description complexity

BibTeX Reference

Warning: This BibTeX entry is automatically generated from the database. As there is no one-to-one match between the database fields and the BibTeX format, there may be errors in the entry. Regard the BibTeX feature as experimental for now. Use with care and correct errors and omissions manually.
Please, do provide feedback about this feature to Michael Lerjen.

@article{matrix-completi,
    author = {Riegler, Erwin and Koliander, Günther and Stotz, David and Bölcskei, Helmut},
    title = {Completion of matrices with low description complexity},
    journal = {Mathematical Statistics and Learning},
    status = {submitted},
    month = nov,
    year = 2023,
    keywords = {Matrix completion, compressed sensing, geometric measure theory, Hausdorff dimension, Minkowski dimension, rank-1 measurements},
    url = {http://www.nari.ee.ethz.ch/pubs/p/matrix-completi}
}

LaTeX Reference

\bibitem{matrix-completi} E. Riegler, G. Koliander, D. Stotz, and H. Bölcskei, ``Completion of matrices with low description complexity,'' \emph{Mathematical Statistics and Learning}, Nov. 2023, submitted.

HTML Reference

E. Riegler, G. Koliander, D. Stotz, and H. Bölcskei, "Completion of matrices with low description complexity," Mathematical Statistics and Learning, Nov. 2023, submitted.