Moments, positive polynomials and their applications
From MaRDI portal
Publication:3395491
global optimizationsemidefinite programmingMarkov chainsNash equilibriaPositivstellensatzsemi-algebraic setssystems of polynomial equationsgeneral moment problem
Convex programming (90C25) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Semialgebraic sets and related spaces (14P10) Method of moments applied to problems in optics and electromagnetic theory (78M05) Solving polynomial systems; resultants (13P15)
Recommendations
- A semidefinite programming approach to the generalized problem of moments
- The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
- An introduction to polynomial and semi-algebraic optimization
- Moments and sums of squares for polynomial optimization and related problems
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
Cited in
(only showing first 100 items - show all)- The moment problem
- Technical note: Options portfolio selection
- Spectrahedral shadows
- A unified framework of SAGE and SONC polynomials and its duality theory
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- An overview of semidefinite relaxations for optimal power flow problem
- Sums of squares of polynomials with rational coefficients
- Noncommutative polynomials nonnegative on a variety intersect a convex set
- A convex optimization model for finding non-negative polynomials
- Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\)
- Do sums of squares dream of free resolutions?
- Minimizing the sum of many rational functions
- On the extreme points of moments sets
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
- Semidefinite optimization estimating bounds on linear functionals defined on solutions of linear ODEs
- Separability of Hermitian tensors and PSD decompositions
- Realizable second-order finite-volume schemes for the advection of moment sets of the particle size distribution
- Matrix convex hulls of free semialgebraic sets
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Optimal estimation of Gaussian mixtures via denoised method of moments
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Hyperbolic quadrature method of moments for the one-dimensional kinetic equation
- Linear conic optimization for inverse optimal control
- The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
- Regularization method for the generalized moment problem in a functional reproducing kernel Hilbert space
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- Maximum entropy and integer partitions
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- A Positivstellensatz for sums of nonnegative circuit polynomials
- Policy iteration in finite templates domain
- Dual optimal design and the Christoffel-Darboux polynomial
- The core variety of a multisequence in the truncated moment problem
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets
- Global minimization of polynomial integral functionals
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Typical real ranks of binary forms
- Qualification Conditions in Semialgebraic Programming
- Positive polynomials and semidefinite programming
- Convergence of Lasserre's hierarchy: the general case
- Applications of sums of squares
- Polynomials with bounds and numerical approximation
- Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets
- Book review of: M. Aschenbrenner et al., Asymptotic differential algebra and model theory of transseries
- A universal framework for entanglement detection under group symmetry
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Tensor eigenvalue complementarity problems
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- A semidefinite programming approach to the generalized problem of moments
- Local saddle points for unconstrained polynomial optimization
- Optimal data fitting: a moment approach
- Tangencies and polynomial optimization
- The geometry of SDP-exactness in quadratic optimization
- A utopia point method-based robust vector polynomial optimization scheme
- Hausdorff distance between convex semialgebraic sets
- Tensor theta norms and low rank recovery
- Algorithms for positive polynomial approximation
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- On a construction method of new moment sequences
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Computation of sum of squares polynomials from data points
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Sums of squares and varieties of minimal degree
- Nonnegative Morse polynomial functions and polynomial optimization
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- The 2013 Newton Institute Programme on polynomial optimization
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Exploiting constant trace property in large-scale polynomial optimization
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- Moment-sequence transforms
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Cyclic convex bodies and optimization moment problems
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- Genericity in polynomial optimization
- A note on polynomial maps having fibers of maximal dimension
- The rate of convergence of the block counting process of exchangeable coalescents with dust
- Sparse moments of univariate step functions and allele frequency spectra
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes
- The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability
- Computing generalized Nash equilibria by polynomial programming
- The moment-SOS hierarchy: applications and related topics
- The operator approach to the truncated multidimensional moment problem
- Compactness criteria for real algebraic sets and Newton polyhedra
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- A Sum of Squares Characterization of Perfect Graphs
- Learning-based sensitivity analysis and feedback design for drug delivery of mixed therapy of cancer in the presence of high model uncertainties
- Learning Dynamical Systems with Side Information
- Set-membership errors-in-variables identification of MIMO linear systems
- Bounding the support of a measure from its marginal moments
- Fast sampling from \(\beta \)-ensembles
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- Moment closure approximations of the Boltzmann equation based on \(\varphi \)-divergences
- Alea iacta est: auctions, persuasion, interim rules, and dice
- Certifying unstability of switched systems using sum of squares programming
- Book Review: The basic George B. Dantzig
- Minimizing rational functions: a hierarchy of approximations via pushforward measures
- The dual cone of sums of non-negative circuit polynomials
This page was built for publication: Moments, positive polynomials and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395491)
