A semidefinite programming approach to the generalized problem of moments
From MaRDI portal
Publication:995783
Recommendations
- Moments, positive polynomials and their applications
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- Positive polynomials and semidefinite programming
- Semidefinite programming relaxations for semialgebraic problems
- Convergence of Lasserre's hierarchy: the general case
Cites work
- scientific article; zbMATH DE number 40939 (Why is no real title available?)
- scientific article; zbMATH DE number 465663 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 6846220 (Why is no real title available?)
- scientific article; zbMATH DE number 3219899 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3191506 (Why is no real title available?)
- scientific article; zbMATH DE number 3107192 (Why is no real title available?)
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Approximation Schemes for Infinite Linear Programs
- Bounds on measures satisfying moment conditions.
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convex Duality and Nonlinear Optimal Control
- Distinguished representations of strictly positive polynomials
- Exponentially bounded positive definite functions
- Global optimization of rational functions: a semidefinite programming approach
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- Markov chains and invariant probabilities
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- On sharpness of Tchebycheff-type inequalities
- On the relation between the multidimensional moment problem and the one-dimensional moment problem.
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Optimization of Polynomials on Compact Semialgebraic Sets
- PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
- Polynomials that are positive on an interval
- Quasi-analytic vectors
- Revisiting two theorems of Curto and Fialkow on moment matrices
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- The \(K\)-moment problem for compact semi-algebraic sets
- The classical moment problem as a self-adjoint finite difference operator
- The extrema of probability determined by generalized moments. I: Bounded random variables
- The truncated complex $K$-moment problem
Cited in
(45)- Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023
- Moment-recovered approximations of multivariate distributions: the Laplace transform inver\-sion
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Coarse-convex-compactification approach to numerical solution of nonconvex variational problems
- On Multivariate Discrete Moment Problems: Generalization of the Bivariate Min Algorithm for Higher Dimensions
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Some algebraic methods for solving multiobjective polynomial integer programs
- Tight bounds for a class of data-driven distributionally robust risk measures
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- A convex optimization model for finding non-negative polynomials
- Exact relaxations of non-convex variational problems
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
- scientific article; zbMATH DE number 2068069 (Why is no real title available?)
- Lower bounds for cubic optimization over the sphere
- A semidefinite approach for truncated \(K\)-moment problems
- Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
- Generalized truncated moment problems with unbounded sets
- Moments and sums of squares for polynomial optimization and related problems
- The \(K\)-moment problem with densities
- Optimal control of switching topology networks
- On Optimal Cell Average Decomposition for High-Order Bound-Preserving Schemes of Hyperbolic Conservation Laws
- Semidefinite programming for min-max problems and games
- A semidefinite algorithm for completely positive tensor decomposition
- Distributionally robust optimization with polynomial densities: theory, models and algorithms
- A polynomial approach for optimal control of switched nonlinear systems
- Nonstationary LPV control for trajectory tracking: a double pendulum example
- Moments, positive polynomials and their applications
- On the uniqueness of solutions for the basis pursuit in the continuum
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- Symmetric tensor nuclear norms
- Linear optimization with cones of moments and nonnegative polynomials
- Probability estimation via policy restrictions, convexification, and approximate sampling
- Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation
- Minimizing the sum of many rational functions
- Multivariate truncated moments problems and maximum entropy
- Completely positive tensor recovery with minimal nuclear value
- On distributional robust probability functions and their computations
- Quadratic tensor eigenvalue complementarity problems
- Reconstruction of conditional expectations from product moments with applications
- Semidefinite relaxations of dynamical programs under discrete constraints
- Moment-SoS methods for optimal transport problems
- The \(\mathcal A\)-truncated \(K\)-moment problem
This page was built for publication: A semidefinite programming approach to the generalized problem of moments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995783)
