Simon Foucart
Complete papers inventory


  1. M. Ettehad, S. F., Instances of computational optimal recovery: dealing with observation errors. (pdf) (reproducible)
  2. S. F., D. Koslicki, Finer metagenomic reconstruction via biodiversity optimization. (pdf) (reproducible)
  3. S. F., D. Needell, R. Pathak, Y. Plan, M. Wootters, Weighted matrix completion from non-random, non-uniform sampling patterns. (arXiv)
  4. I. Daubechies, R. DeVore, S. F., B. Hanin, G. Petrova, Nonlinear approximation and (deep) ReLU networks. (pdf)

Journal publications

  1. S. F., Instances of computational optimal recovery: refined approximability models.
    Journal of Complexity. To appear. (doi) (pdf) (reproducible)
  2. S. F., Facilitating OWL norm minimizations.
    Optimization Letters. To appear. (doi) (pdf) (reproducible)
  3. M. Ettehad, S. F., Approximability models and optimal system identification.
    Mathematics of Control, Signals, and Systems, 32/1, 19--41, 2020. (doi) (pdf) (reproducible)
  4. S. F., Sampling schemes and recovery algorithms for functions of few coordinate variables.
    Journal of Complexity, 58, 101457, 2020. (doi) (pdf) (reproducible)
  5. S. F., R. Gribonval, L. Jacques, H. Rauhut, Jointly low-rank and bisparse recovery: questions and partial answers.
    Analysis and Applications, 18/1, 25--48, 2020. (doi) (pdf)
  6. S. F., J. B. Lasserre, Computation of Chebyshev polynomials for union of intervals.
    Computational Methods and Function Theory, 19/4, 625--641, 2019. (doi) (pdf) (reproducible)
  7. S. F., M. Hielsberg, G. Mullendore, G. Petrova, P. Wojtaszczyk, Optimal algorithms for computing average temperatures.
    Mathematics of Climate and Weather Forecasting, 5, 34--44, 2019. (doi) (pdf) (reproducible)
  8. S. F., S. Subramanian, Iterative hard thresholding for low-rank recovery from rank-one projections.
    Linear Algebra and its Applications, 572, 117--134, 2019. (doi) (pdf) (reproducible)
  9. S. F., R. Lynch, Recovering low-rank matrices from binary measurements.
    Inverse Problems and Imaging, 13/4, 703--720, 2019. (doi) (pdf) (reproducible)
  10. S. F., J. B. Lasserre, Determining projection constants of univariate polynomial spaces.
    Journal of Approximation Theory, 235, 74--91, 2018. (doi) (pdf) (reproducible)
  11. R. DeVore, S. F., G. Petrova, P. Wojtaszczyk, Computing a quantity of interest from observational data.
    Constructive Approximation, 49/3, 461--508, 2019. (doi) (pdf) (reproducible) (reproducible+supplement)
  12. S. F., J. Li, Sparse recovery from inaccurate saturated measurements.
    Acta Applicandae Mathematicae, 158/1, 49--66, 2018. (doi) (pdf) (reproducible)
  13. B. Deregowska, S. F., B. Lewandowska, L. Skrzypek, On the norms and minimal properties of de la Vallée Poussin’s type operators.
    Monatshefte für Mathematik, 185/4, 601--619, 2018. (doi) (pdf)
  14. S. F., Concave Mirsky inequality and low-rank recovery.
    SIAM Journal on Matrix Analysis and Applications, 39/1, 99–-103, 2018. (doi) (pdf)
  15. S. F., G. Lecué, An IHT algorithm for sparse recovery from subexponential measurements.
    IEEE Signal Processing Letters, 24/9, 1280--1283, 2017. (doi) (pdf)
  16. R. Baraniuk, S. F., D. Needell, Y. Plan, M. Wootters, One-bit compressive sensing of dictionary-sparse signals.
    Information and Inference, 7/1, 83--104, 2018. (doi) (pdf)
  17. R. Baraniuk, S. F., D. Needell, Y. Plan, M. Wootters, Exponential decay of reconstruction error from binary measurements of sparse signals.
    IEEE Transactions on Information Theory, 63/6, 3368--3385, 2017. (doi) (pdf) (reproducible)
  18. S. F., L. Skrzypek, On maximal relative projection constants.
    Journal of Mathematical Analysis and Applications, 447/1, 309--328, 2017. (doi) (pdf) (reproducible) (supplement)
  19. S. F., T. Needham, Sparse recovery from saturated measurements.
    Information and Inference, 6/2, 196--212, 2017. (doi) (pdf) (reproducible)
  20. S. F., V. Powers, Basc: constrained approximation by semidefinite programming.
    IMA Journal on Numerical Analysis, 37/2, 1066--1085, 2017. (doi) (pdf) (reproducible)
  21. J.-L. Bouchot, S. F., P. Hitczenko, Hard thresholding pursuit algorithms: number of iterations.
    Applied and Computational Harmonic Analysis, 41/2, 412--435, 2016. (doi) (pdf) (reproducible)
  22. S. F., Computation of minimal projections and extensions.
    Numerical Functional Analysis and Optimization, 37/2, 159--185, 2016. (doi) (pdf) (reproducible)
  23. S. F., Dictionary-sparse recovery via thresholding-based algorithms.
    Journal of Fourier Analysis and Applications, 22/1, 6--19, 2016. (doi) (pdf)
  24. S. F., M. Minner, T. Needham, Sparse disjointed recovery from noninflating measurements.
    Applied and Computational Harmonic Analysis, 39/3, 558--567, 2015. (doi) (pdf) (reproducible)
  25. D. Koslicki, S. F., G. Rosen, WGSQuikr: fast whole-genome shotgun metagenomic classification.
    PLoS ONE, 9/3, e91784, 2014. (doi) (pdf)
  26. S. F., D. Koslicki, Sparse recovery by means of nonnegative least squares.
    IEEE Signal Processing Letters, 21/4, 498--502, 2014. (doi) (pdf) (reproducible)
  27. D. Koslicki, S. F., G. Rosen, Quikr: a method for rapid reconstruction of bacterial communities via compressive sensing.
    Bioinformatics, 29/17, 2096--2102, 2013. (doi) (pdf)
  28. S. F., Stability and robustness of $\ell_1$-minimizations with Weibull matrices and redundant dictionaries.
    Linear Algebra and its Applications, 441, 4--21, 2014. (doi) (pdf)
  29. S. F., T. Sorokina, Generating dimension formulas for multivariate splines.
    Albanian Journal of Mathematics, 7/1, 24--35, 2013. (article) (pdf)
  30. S. F., Hard thresholding pursuit: an algorithm for compressive sensing.
    SIAM Journal on Numerical Analysis, 49/6, 2543--2563, 2011. (doi) (pdf)
  31. S. F., A. Pajor, H. Rauhut, T. Ullrich, The Gelfand widths of $\ell_p$-balls for $0 < p \le 1$.
    Journal of Complexity, 26/6, 629--640, 2010. (doi) (pdf)
  32. S. F., R. Gribonval, Real versus complex null space properties for sparse vector recovery.
    Comptes Rendus de l'Academie des Sciences, 348/15-16, 863--865, 2010. (doi) (pdf)
  33. S. F., A note on guaranteed sparse recovery via $\ell_1$-minimization.
    Applied and Computational Harmonic Analysis, 29/1, 97--103, 2010. (doi) (pdf)
  34. S. F., M.-J. Lai, Sparse recovery with pre-Gaussian random matrices.
    Studia Mathematica, 200, 91--102, 2010. (doi) (pdf)
  35. S. F., Allometry constants of finite-dimensional spaces: theory and computations.
    Numerische Mathematik, 112/4, 535--564, 2009. (doi) (pdf)
  36. S. F., M.-J. Lai, Sparsest solutions of underdetermined linear systems via $\ell_q$-minimization for $0 < q \le 1$.
    Applied and Computational Harmonic Analysis, 26/3, 395--407, 2009. (doi) (pdf) (reproducible)
  37. S. F., Open questions around the spline orthoprojector.
    East Journal on Approximations, 14/2, 241--253, 2008. (pdf)
  38. S. F., Yu. Kryakin, A. Shadrin, On the exact constant in Jackson-Stechkin inequality for the uniform metric.
    Constructive Approximation, 29/2, 157--179, 2009. (doi) (pdf)
  39. S. F., On the value of the max-norm of the orthogonal projector onto splines with multiple knots.
    Journal of Approximation Theory, 140/2, 154--177, 2006. (doi) (pdf)
  40. S. F., Interlacing property for B-splines.
    Journal of Approximation Theory, 135/1, 1--21, 2005. (doi) (pdf)
  41. S. F., On the best conditioned bases of quadratic polynomials.
    Journal of Approximation Theory, 130/1, 46--56, 2004. (doi) (pdf)


  1. S. F., Flavors of compressive sensing.
    Approximation Theory XV: San Antonio 2016, Springer Proceedings in Mathematics & Statistics, vol 201, 61--104. (doi) (pdf) (reproducible)

Refereed proceedings

  1. S. F., L. Jacques, One-bit sensing of low-rank and bisparse matrices.
    Proceedings of SampTA 2019, Bordeaux. (doi) (pdf)
  2. S. F., D. Needell. Y. Plan, M. Wootters, De-biasing low-rank projection for matrix completion.
    Wavelets and Sparsity XVII, International Society for Optics and Photonics, 2017. (doi) (pdf)
  3. S. F., Complexity of multivariate problems based on binary information.
    Proceedings of SampTA 2017, Tallinn. (doi) (pdf)
  4. S. F., Stability and robustness of weak orthogonal matching pursuits.
    Recent Advances in Harmonic Analysis and Applications, Springer Proceedings in Mathematics & Statistics, vol 25, 395--405. (proceedings) (pdf)
  5. S. F., Recovering jointly sparse vectors via hard thresholding pursuit.
    Proceedings of SampTA 2011, Singapore. (proceedings) (pdf)
  6. A. Cohen, R. DeVore, S. F., H. Rauhut, Recovery of functions of many variables via compressive sensing.
    Proceedings of SampTA 2011, Singapore. (proceedings) (pdf)
  7. S. F., Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants.
    Approximation Theory XIII: San Antonio 2010, Springer Proceedings in Mathematics, vol 13, 65--77. (proceedings) (pdf)
  8. S. F., Some comments on the comparison between condition numbers and projection constants.
    Approximation Theory XII: San Antonio 2007, M. Neamtu and L. L. Schumaker (eds.), Nashboro Press, 2008, 143--156. (pdf)

Not for publication

  1. S. F., Three topics in multivariate spline theory. (pdf) (reproducible)
  2. P. Clarke, S. F., Symbolic spline computations. (pdf)
  3. F. Balabdaoui, S. F., J. Wellner, On the Hermite spline conjecture and its connection to k-monotone densities. (pdf)
  4. S. F., T. Sorokina, On the dimension of multivariate spline spaces, especially on Alfeld splits. (pdf)
  5. S. F., On definitions of discrete topological chaos and their relations on intervals. (pdf)