The moment-SOS hierarchy: applications and related topics
From MaRDI portal
(Redirected from Publication:6598421)
Recommendations
Cites work
- \(k\)-point semidefinite programming bounds for equiangular lines
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A disintegration of the Christoffel function
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hierarchy of spectral relaxations for polynomial optimization
- A moment approach for entropy solutions to nonlinear hyperbolic PDEs
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- A new sparse SOS decomposition algorithm based on term sparsity
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Accurate and Efficient Reconstruction of Discontinuous Functions from Truncated Series Expansions
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- An introduction to polynomial and semi-algebraic optimization
- Anneaux preordonnes
- Approximate volume and integration for basic semialgebraic sets
- Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
- Bounds for projective codes from semidefinite programming
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
- Bounds on measures satisfying moment conditions.
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Complex Equilibrium Measure and Bernstein Type Theorems for Compact Sets in R n
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Connecting optimization with spectral analysis of tri-diagonal matrices
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convex computation of the maximum controlled invariant set for polynomial control systems
- Convex Duality and Nonlinear Optimal Control
- Convex generalized Nash equilibrium problems and polynomial optimization
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- Exploiting constant trace property in large-scale polynomial optimization
- Exploiting sparsity for semi-algebraic set volume computation
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- Géza Freud, orthogonal polynomials and Christoffel functions. A case study
- Global optimization with polynomials and the problem of moments
- Graph recovery from incomplete moment information
- Handbook on semidefinite, conic and polynomial optimization
- Hardness of approximation
- Hermitian tensor decompositions
- HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS
- scientific article; zbMATH DE number 1601019 (Why is no real title available?)
- scientific article; zbMATH DE number 5971212 (Why is no real title available?)
- scientific article; zbMATH DE number 4052269 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1064079 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 2146387 (Why is no real title available?)
- scientific article; zbMATH DE number 3193809 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Localization With One-Bit Passive Radars in Narrowband Internet-of-Things Using Multivariate Polynomial Optimization
- Low rank symmetric tensor approximations
- Moment and Polynomial Optimization
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Moments and convex optimization for analysis and control of nonlinear PDEs
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- New dense superball packings in three dimensions
- New upper bounds for kissing numbers from semidefinite programming
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- On the Complexity of Computing the Volume of a Polyhedron
- On the complexity of Schmüdgen's Positivstellensatz
- On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimisation globale et théorie des moments
- Optimization of polynomials in non-commuting variables
- Pell's equation, sum-of-squares and equilibrium measures on a compact set
- Playing unique games on certified small-set expanders
- Positive polynomials and sums of squares
- Positive polynomials in control.
- PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
- Representing polynomials by positive linear functions on compact convex polyhedra
- Scalable semidefinite programming
- SDP relaxations for non-commutative polynomial optimization
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
- Semi-algebraic approximation using Christoffel-Darboux kernel
- Semidefinite programming for min-max problems and games
- Semidefinite programming relaxations and algebraic optimization in control
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- SOS is not obviously automatizable, even approximately
- Sparse Polynomial Optimization
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Sparsity in sums of squares of polynomials
- Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
- Stokes, Gibbs, and volume computation of semi-algebraic sets
- Sum of squares method for sensor network localization
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- Sum-of-squares proofs and the quest toward optimal algorithms
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
- Synergies Between Operations Research and Quantum Information Science
- Tensor eigenvalue complementarity problems
- The K-moment problem for compact semi-algebraic sets
- The K-moment problem for continuous linear functionals
- The Christoffel-Darboux Kernel
- The Christoffel-Darboux kernel for data analysis
- The Complex Equilibrium Measure of a Symmetric Convex Set in R n
- The moment problem
- The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Cited in
(3)
This page was built for publication: The moment-SOS hierarchy: applications and related topics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598421)
