Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
From MaRDI portal
Publication:2000529
DOI10.1007/s10444-019-09672-2zbMath1417.90112arXiv1708.06187OpenAlexW2901849449MaRDI QIDQ2000529
Cédric Josz, Mourrain, Bernard, Jean-Bernard Lasserre
Publication date: 28 June 2019
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.06187
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Recovery of Atomic Measures on the Unit Sphere, Prony's method on the sphere, Learning algebraic decompositions using Prony structures, Short Communication: Weak Sparse Superresolution is Well-Conditioned
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Super-resolution from noisy data
- Prony's method in several variables
- Exact support recovery for sparse spikes deconvolution
- A multivariate generalization of Prony's method
- Interpolating polynomials from their values
- The restricted isometry property and its implications for compressed sensing
- A generalized flat extension theorem for moment matrices
- Polynomial-exponential decomposition from moments
- On approximation of functions by exponential sums
- Spike detection from inaccurate samplings
- Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- Nonlinear approximation by sums of nonincreasing exponentials
- Sparse Interpolation and Rational Approximation
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- A performance analysis of subspace-based methods in the presence of model errors. I. The MUSIC algorithm
- Linear Programming
- Separable nonlinear least squares: the variable projection method and its applications
- Decomposition of Low Rank Multi-symmetric Tensor
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- MultiDimensional Sparse Super-Resolution
- Exponential Data Fitting and its Applications
- Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values
- A Probabilistic and RIPless Theory of Compressed Sensing
- Optimization, a Moment Problem, and Nonlinear Programming
- Nearly optimal sparse fourier transform
- Towards a Mathematical Theory of Super‐resolution
- Stable signal recovery from incomplete and inaccurate measurements
- Shift-register synthesis and BCH decoding
- Symbolic-numeric sparse interpolation of multivariate polynomials
