Moments, positive polynomials and their applications
From MaRDI portal
Publication:3395491
zbMATH Open1211.90007MaRDI QIDQ3395491FDOQ3395491
Authors: Jean B. Lasserre 
Publication date: 2 September 2009
Full work available at URL: http://ebooks.worldscinet.com/ISBN/9781848164468/toc.shtml
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
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)
Cited In (only showing first 100 items - show all)
- Noncommutative polynomials nonnegative on a variety intersect a convex set
- Sums of squares of polynomials with rational coefficients
- Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\)
- On the extreme points of moments sets
- Minimizing the sum of many rational functions
- Realizable second-order finite-volume schemes for the advection of moment sets of the particle size distribution
- Matrix convex hulls of free semialgebraic sets
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- The core variety of a multisequence in the truncated moment problem
- Typical real ranks of binary forms
- Positive polynomials and semidefinite programming
- Polynomials with bounds and numerical approximation
- Tensor eigenvalue complementarity problems
- A semidefinite programming approach to the generalized problem of moments
- The geometry of SDP-exactness in quadratic optimization
- Algorithms for positive polynomial approximation
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Computation of sum of squares polynomials from data points
- Tensor theta norms and low rank recovery
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Nonnegative Morse polynomial functions and polynomial optimization
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- A note on polynomial maps having fibers of maximal dimension
- The rate of convergence of the block counting process of exchangeable coalescents with dust
- Bounding the support of a measure from its marginal moments
- Book Review: The basic George B. Dantzig
- Minimizing rational functions: a hierarchy of approximations via pushforward measures
- Moment closure approximations of the Boltzmann equation based on \(\varphi \)-divergences
- Linear optimization with cones of moments and nonnegative polynomials
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Positivity, sums of squares and the multi-dimensional moment problem II
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- The convex Positivstellensatz in a free algebra
- Algorithm 996
- Positive Gorenstein ideals
- Design of Marx generators as a structured eigenvalue assignment
- Infinite dimensional moment problem: open questions and applications
- A ``joint+marginal approach to parametric polynomial optimization
- The quintic complex moment problem
- Moments and sums of squares for polynomial optimization and related problems
- The full infinite dimensional moment problem on semi-algebraic sets of generalized functions
- On the truncated two-dimensional moment problem
- The cubic complex moment problem
- Free semidefinite representation of matrix power functions
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- The approach of moments for polynomial equations
- Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets
- Moment problem in infinitely many variables
- Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control
- Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis
- Characterization of the moment space corresponding to the Levermore basis
- A regularized entropy-based moment method for kinetic equations
- A new approximation hierarchy for polynomial conic optimization
- Mean squared error minimization for inverse moment problems
- Lebesgue decomposition in action via semidefinite relaxations
- Complex orthogonal polynomials and numerical quadrature via hyponormality
- Generalized maximum entropy estimation
- An introduction to polynomial and semi-algebraic optimization
- A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems
- Convergence rates of moment-sum-of-squares hierarchies for optimal control problems
- Borel measures with a density on a compact semi-algebraic set
- Moment approximations for set-semidefinite polynomials
- Algebraic-exponential data recovery from moments
- Synthesizing invariant barrier certificates via difference-of-convex programming
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- Approximate optimal designs for multivariate polynomial regression
- Exact safety verification of hybrid systems using sums-of-squares representation
- Three-monotone interpolation
- The moment problem
- 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
- Do sums of squares dream of free resolutions?
- Semidefinite optimization estimating bounds on linear functionals defined on solutions of linear ODEs
- Hyperbolic quadrature method of moments for the one-dimensional kinetic equation
- Regularization method for the generalized moment problem in a functional reproducing kernel Hilbert space
- Optimal estimation of Gaussian mixtures via denoised method of moments
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Linear conic optimization for inverse optimal control
- Maximum entropy and integer partitions
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- A Positivstellensatz for sums of nonnegative circuit polynomials
- Policy iteration in finite templates domain
- Dual optimal design and the Christoffel-Darboux polynomial
- Qualification Conditions in Semialgebraic Programming
- Book review of: M. Aschenbrenner et al., Asymptotic differential algebra and model theory of transseries
- Distribution‐constrained optimal stopping
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Sums of squares and varieties of minimal degree
- 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
- Moment-sequence transforms
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
Uses Software
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)
