# | Title | Journal | Year | Citations |
---|
|
1 | Exact Matrix Completion via Convex Optimization | Foundations of Computational Mathematics | 2009 | 3,637 |
2 | The Convex Geometry of Linear Inverse Problems | Foundations of Computational Mathematics | 2012 | 802 |
3 | Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit | Foundations of Computational Mathematics | 2009 | 741 |
4 | User-Friendly Tail Bounds for Sums of Random Matrices | Foundations of Computational Mathematics | 2012 | 622 |
5 | Random Gradient-Free Minimization of Convex Functions | Foundations of Computational Mathematics | 2017 | 395 |
6 | Adaptive Restart for Accelerated Gradient Schemes | Foundations of Computational Mathematics | 2015 | 391 |
7 | Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions | Foundations of Computational Mathematics | 2006 | 375 |
8 | Optimality of a Standard Adaptive Finite Element Method | Foundations of Computational Mathematics | 2007 | 337 |
9 | A Rigorous ODE Solver and Smale’s 14th Problem | Foundations of Computational Mathematics | 2002 | 328 |
10 | Trust-Region Methods on Riemannian Manifolds | Foundations of Computational Mathematics | 2007 | 285 |
11 | Optimal Rates for the Regularized Least-Squares Algorithm | Foundations of Computational Mathematics | 2007 | 282 |
12 | Random Projections of Smooth Manifolds | Foundations of Computational Mathematics | 2009 | 265 |
13 | Convergence Rates of Best N-term Galerkin Approximations for a Class of Elliptic sPDEs | Foundations of Computational Mathematics | 2010 | 240 |
14 | A Theoretical and Computational Framework for Isometry Invariant Recognition of Point Cloud Data | Foundations of Computational Mathematics | 2005 | 235 |
15 | Gromov–Wasserstein Distances and the Metric Approach to Object Matching | Foundations of Computational Mathematics | 2011 | 228 |
16 | Nonlinear Methods of Approximation | Foundations of Computational Mathematics | 2003 | 211 |
17 | Exact Support Recovery for Sparse Spikes Deconvolution | Foundations of Computational Mathematics | 2015 | 209 |
18 | Learning Rates of Least-Square Regularized Regression | Foundations of Computational Mathematics | 2006 | 204 |
19 | Adaptive Wavelet Methods II—Beyond the Elliptic Case | Foundations of Computational Mathematics | 2002 | 198 |
20 | Solving Quadratic Equations via PhaseLift When There Are About as Many Equations as Unknowns | Foundations of Computational Mathematics | 2014 | 185 |
21 | A PDE Approach to Fractional Diffusion in General Domains: A Priori Error Analysis | Foundations of Computational Mathematics | 2015 | 182 |
22 | Zigzag Persistence | Foundations of Computational Mathematics | 2010 | 176 |
23 | Lipschitz Functions Have L p -Stable Persistence | Foundations of Computational Mathematics | 2010 | 171 |
24 | Sliding Windows and Persistence: An Application of Topological Methods to Signal Analysis | Foundations of Computational Mathematics | 2015 | 170 |
25 | On the Stability and Accuracy of Least Squares Approximations | Foundations of Computational Mathematics | 2013 | 168 |
26 | On the Sample Complexity of the Linear Quadratic Regulator | Foundations of Computational Mathematics | 2020 | 163 |
27 | A Geometric Analysis of Phase Retrieval | Foundations of Computational Mathematics | 2018 | 155 |
28 | Local Linear Convergence for Alternating and Averaged Nonconvex Projections | Foundations of Computational Mathematics | 2009 | 150 |
29 | Metamorphoses Through Lie Group Action | Foundations of Computational Mathematics | 2005 | 145 |
30 | On Tensor Completion via Nuclear Norm Minimization | Foundations of Computational Mathematics | 2016 | 139 |
31 | High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs | Foundations of Computational Mathematics | 2014 | 134 |
32 | On the Ranks and Border Ranks of Symmetric Tensors | Foundations of Computational Mathematics | 2010 | 132 |
33 | Geometric Inference for Probability Measures | Foundations of Computational Mathematics | 2011 | 124 |
34 | Generalized Sampling and Infinite-Dimensional Compressed Sensing | Foundations of Computational Mathematics | 2016 | 124 |
35 | Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods | Foundations of Computational Mathematics | 2018 | 123 |
36 | The Euclidean Distance Degree of an Algebraic Variety | Foundations of Computational Mathematics | 2016 | 121 |
37 | Approximations of Shape Metrics and Application to Shape Warping and Empirical Shape Statistics | Foundations of Computational Mathematics | 2005 | 120 |
38 | The Serendipity Family of Finite Elements | Foundations of Computational Mathematics | 2011 | 116 |
39 | Model Selection for Regularized Least-Squares Algorithm in Learning Theory | Foundations of Computational Mathematics | 2005 | 115 |
40 | Projective Plane and Planar Quantum Codes | Foundations of Computational Mathematics | 2001 | 113 |
41 | Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit | Foundations of Computational Mathematics | 2008 | 113 |
42 | Stability and Instance Optimality for Gaussian Measurements in Compressed Sensing | Foundations of Computational Mathematics | 2010 | 111 |
43 | Application of Quasi-Monte Carlo Methods to Elliptic PDEs with Random Diffusion Coefficients: A Survey of Analysis and Implementation | Foundations of Computational Mathematics | 2016 | 110 |
44 | Hamilton–Pontryagin Integrators on Lie Groups Part I: Introduction and Structure-Preserving Properties | Foundations of Computational Mathematics | 2009 | 108 |
45 | Arbitrary-Order Trigonometric Fourier Collocation Methods for Multi-Frequency Oscillatory Systems | Foundations of Computational Mathematics | 2016 | 108 |
46 | Combinatorial Sublinear-Time Fourier Algorithms | Foundations of Computational Mathematics | 2010 | 106 |
47 | Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization | Foundations of Computational Mathematics | 2011 | 102 |
48 | An Interpolating Distance Between Optimal Transport and Fisher–Rao Metrics | Foundations of Computational Mathematics | 2018 | 100 |
49 | Hyperbolic Programs, and Their Derivative Relaxations | Foundations of Computational Mathematics | 2006 | 97 |
50 | Exact Computation of Joint Spectral Characteristics of Linear Operators | Foundations of Computational Mathematics | 2013 | 95 |
51 | Online Learning Algorithms | Foundations of Computational Mathematics | 2006 | 92 |
52 | Extending Persistence Using Poincaré and Lefschetz Duality | Foundations of Computational Mathematics | 2009 | 89 |
53 | On the Ideals of Secant Varieties of Segre Varieties | Foundations of Computational Mathematics | 2004 | 87 |
54 | The Theory of the Interleaving Distance on Multidimensional Persistence Modules | Foundations of Computational Mathematics | 2015 | 86 |
55 | Symmetric Exponential Integrators with an Application to the Cubic Schrödinger Equation | Foundations of Computational Mathematics | 2008 | 85 |
56 | Joint Invariant Signatures | Foundations of Computational Mathematics | 2001 | 84 |
57 | Robust Computation of Linear Models by Convex Relaxation | Foundations of Computational Mathematics | 2015 | 84 |
58 | Tensor Networks and Hierarchical Tensors for the Solution of High-Dimensional Partial Differential Equations | Foundations of Computational Mathematics | 2016 | 84 |
59 | Stochastic Subgradient Method Converges on Tame Functions | Foundations of Computational Mathematics | 2020 | 82 |
60 | Rigorous Numerics for Partial Differential Equations: The Kuramoto—Sivashinsky Equation | Foundations of Computational Mathematics | 2001 | 81 |
61 | An Algorithmic Approach to Chain Recurrence | Foundations of Computational Mathematics | 2005 | 81 |
62 | Sign Conditions for Injectivity of Generalized Polynomial Maps with Applications to Chemical Reaction Networks and Real Algebraic Geometry | Foundations of Computational Mathematics | 2016 | 81 |
63 | On the Rank of a Binary Form | Foundations of Computational Mathematics | 2011 | 80 |
64 | Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals | Foundations of Computational Mathematics | 2008 | 79 |
65 | Multi-level Quasi-Monte Carlo Finite Element Methods for a Class of Elliptic PDEs with Random Coefficients | Foundations of Computational Mathematics | 2015 | 78 |
66 | A Variational Complex for Difference Equations | Foundations of Computational Mathematics | 2004 | 75 |
67 | Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution | Foundations of Computational Mathematics | 2020 | 73 |
68 | The $${\mathcal {A}}$$ A -Truncated $$K$$ K -Moment Problem | Foundations of Computational Mathematics | 2014 | 72 |
69 | Sharp Recovery Bounds for Convex Demixing, with Applications | Foundations of Computational Mathematics | 2014 | 68 |
70 | Construction of Approximate Entropy Measure-Valued Solutions for Hyperbolic Systems of Conservation Laws | Foundations of Computational Mathematics | 2017 | 68 |
71 | Infinite-Dimensional Compressed Sensing and Function Interpolation | Foundations of Computational Mathematics | 2018 | 67 |
72 | Infinite-Dimensional Quadrature and Approximation of Distributions | Foundations of Computational Mathematics | 2009 | 64 |
73 | The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series | Foundations of Computational Mathematics | 2006 | 63 |
74 | Analysis of a New Nonlinear Subdivision Scheme. Applications in Image Processing | Foundations of Computational Mathematics | 2006 | 63 |
75 | Online Gradient Descent Learning Algorithms | Foundations of Computational Mathematics | 2008 | 63 |
76 | Error Estimates for Spectral Convergence of the Graph Laplacian on Random Geometric Graphs Toward the Laplace–Beltrami Operator | Foundations of Computational Mathematics | 2020 | 62 |
77 | Convergence of the Magnus Series | Foundations of Computational Mathematics | 2008 | 61 |
78 | Approximation Methods for Supervised Learning | Foundations of Computational Mathematics | 2006 | 60 |
79 | Algebraic Structures of B-series | Foundations of Computational Mathematics | 2010 | 60 |
80 | A Gradient-Descent Method for Curve Fitting on Riemannian Manifolds | Foundations of Computational Mathematics | 2012 | 60 |
81 | On Post-Lie Algebras, Lie–Butcher Series and Moving Frames | Foundations of Computational Mathematics | 2013 | 60 |
82 | Low Regularity Exponential-Type Integrators for Semilinear Schrödinger Equations | Foundations of Computational Mathematics | 2018 | 60 |
83 | Solving the Likelihood Equations | Foundations of Computational Mathematics | 2005 | 59 |
84 | Learning Functions of Few Arbitrary Linear Parameters in High Dimensions | Foundations of Computational Mathematics | 2012 | 59 |
85 | Analysis of Discrete $$L^2$$ L 2 Projection on Polynomial Spaces with Random Evaluations | Foundations of Computational Mathematics | 2014 | 59 |
86 | Robust Statistics, Hypothesis Testing, and Confidence Intervals for Persistent Homology on Metric Measure Spaces | Foundations of Computational Mathematics | 2014 | 59 |
87 | Exponentials Reproducing Subdivision Schemes | Foundations of Computational Mathematics | 2003 | 58 |
88 | A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds | Foundations of Computational Mathematics | 2008 | 58 |
89 | Metrics for Generalized Persistence Modules | Foundations of Computational Mathematics | 2015 | 58 |
90 | Transversality and Alternating Projections for Nonconvex Sets | Foundations of Computational Mathematics | 2015 | 58 |
91 | Mean Estimation and Regression Under Heavy-Tailed Distributions: A Survey | Foundations of Computational Mathematics | 2019 | 58 |
92 | Quadratic Newton Iteration for Systems with Multiplicity | Foundations of Computational Mathematics | 2002 | 57 |
93 | Modeling Language Evolution | Foundations of Computational Mathematics | 2004 | 57 |
94 | Direct and Inverse Sobolev Error Estimates for Scattered Data Interpolation via Spherical Basis Functions | Foundations of Computational Mathematics | 2007 | 57 |
95 | Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information | Foundations of Computational Mathematics | 2002 | 55 |
96 | Sobolev Duals for Random Frames and ΣΔ Quantization of Compressed Sensing Measurements | Foundations of Computational Mathematics | 2013 | 55 |
97 | Rigorous Numerics for Dissipative Partial Differential Equations II. Periodic Orbit for the Kuramoto?Sivashinsky PDE?A Computer-Assisted Proof | Foundations of Computational Mathematics | 2004 | 54 |
98 | Discrete Morse Theoretic Algorithms for Computing Homology of Complexes and Maps | Foundations of Computational Mathematics | 2014 | 54 |
99 | Improved Bounds on Sample Size for Implicit Matrix Trace Estimators | Foundations of Computational Mathematics | 2015 | 54 |
100 | On the Hopf Algebraic Structure of Lie Group Integrators | Foundations of Computational Mathematics | 2008 | 53 |