A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
From MaRDI portal
Publication:3105778
DOI10.1137/100806990zbMath1242.90176arXiv1009.0125OpenAlexW2950353857WikidataQ92179790 ScholiaQ92179790MaRDI QIDQ3105778
Publication date: 9 January 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.0125
Nonconvex programming, global optimization (90C26) Set functions and measures on topological spaces (regularity of measures, etc.) (28C15)
Related Items
LP relaxations for a class of linear semi-infinite programming problems, Continuous-variable nonlocality and contextuality, Algebraic Perspectives on Signomial Optimization, Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel, Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere, Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets, Optimal Data Fitting: A Moment Approach, Optimization on the Euclidean Unit Sphere, Moment approximations for set-semidefinite polynomials, Homogenization for polynomial optimization with unbounded sets, Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities, A new certificate for copositivity, Distributionally robust optimization with polynomial densities: theory, models and algorithms, Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023, Quadrature-based polynomial optimization, Positive trigonometric polynomials for strong stability of difference equations, Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets, Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, Harmonic Hierarchies for Polynomial Optimization, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, New approximations for the cone of copositive matrices and its dual, A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis, Connecting optimization with spectral analysis of tri-diagonal matrices, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, Semidefinite approximations of conical hulls of measured sets, Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization, Sum-of-squares hierarchies for binary polynomial optimization, Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization, Mean squared error minimization for inverse moment problems, The moment-SOS hierarchy and the Christoffel-Darboux kernel, Sum-of-squares hierarchies for binary polynomial optimization, Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing, Level Sets and NonGaussian Integrals of Positively Homogeneous Functions, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution, Controller design and value function approximation for nonlinear dynamical systems
Uses Software
