Reconstruction of Algebraic-exponential Data from Moments and Solving a Generalized Lowner-John Prob
summary
Claims exact recovery of algebraic–exponential functions from a finite moment sequence up to order 2d by checking a rank condition on the moment matrix and solving a concrete convex program. Uses moment matrices, polynomial identities and semidefinite relaxation to turn reconstruction into an SDP that outputs coefficients and support parameters. Applies a similar convex formulation to a generalized Lowner–John minimal-volume problem and demonstrates exact recovery on synthetic examples and stability under small Gaussian noise.
AI-written summary · about
chapters (17)
- 0:00Start
- 3:30Exact reconstruction
- 4:09Exact recovery (continued)
- 7:27A little detour
- 9:36Some motivation
- 16:29Proof for nonnegative
- 18:18An alternative proof
- 19:41II. Approximating a non gaussian integral
- 21:28III. Convexity
- 22:29Convexity (continued)
- 24:20Polarity (continued)
- 25:06IV. A variational property of homogeneous polynomials
- 36:02VI. Recovering g from moments of G
- 39:10Non homogeneous polynomials
- 47:09Sketch of the proof
- 51:15Conclusion
- 52:02Some references
