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)
- 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
- A Sum of Squares Characterization of Perfect Graphs
- Genericity in polynomial optimization
- Cyclic convex bodies and optimization moment problems
- Computing generalized Nash equilibria by polynomial programming
- The operator approach to the truncated multidimensional moment problem
- 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
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Compactness criteria for real algebraic sets and Newton polyhedra
- Set-membership errors-in-variables identification of MIMO linear systems
- Fast sampling from \(\beta \)-ensembles
- The dual cone of sums of non-negative circuit polynomials
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- The truncated moment problem on \(\mathbb{N}_0\)
- The Stieltjes condition and multidimensional \({\mathcal{K}} \)-moment problems
- Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
- A hierarchy of spectral relaxations for polynomial optimization
- Real root finding for determinants of linear matrices
- Implementable tensor methods in unconstrained convex optimization
- \(M^2\) spectral estimation: a flexible approach ensuring rational solutions
- Discussion on: ``A decomposition algorithm for KYP-SDPs
- A convex relaxation approach to set-membership identification of LPV systems
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- Computing the Hausdorff boundary measure of semialgebraic sets
- Optimization hierarchy for fair statistical decision problems
- The moment-SOS hierarchy
- Safety of stochastic systems: an analytic and computational approach
- Semi-algebraic approximation using Christoffel-Darboux kernel
- High order moment model for polydisperse evaporating sprays towards interfacial geometry description
- The role of non-negative polynomials for rank-one convexity and quasi convexity
- A MAX-CUT formulation of 0/1 programs
- Real radicals and finite convergence of polynomial optimization problems
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- A moment theoretic approach to estimate the cardinality of certain algebraic varieties
- Recurrence ranks and moment sequences
- Real root finding for low rank linear matrices
- Exploiting sparsity for semi-algebraic set volume computation
- On a solution of the multidimensional truncated matrix-valued moment problem
- Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems
- Spectrahedral shadows
- 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
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)
