Sparse polynomial optimization with unbounded sets
From MaRDI portal
Cites work
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- A note on the representation of positive polynomials with structured sparsity
- A Sparse Version of Reznick’s Positivstellensatz
- An introduction to polynomial and semi-algebraic optimization
- An introduction to trajectory optimization: how to do your own direct collocation
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Complexity of Finding Embeddings in a k-Tree
- Convergence rates for sums-of-squares hierarchies with correlative sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems
- Exploiting term sparsity in noncommutative polynomial optimization
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Generalized truncated moment problems with unbounded sets
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- Global optimization with polynomials and the problem of moments
- Homogenization for polynomial optimization with unbounded sets
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Moment and Polynomial Optimization
- On polynomial optimization over non-compact semi-algebraic sets
- On the complexity of Putinar-Vasilescu's Positivstellensatz
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Positive polynomials and sums of squares
- Positive polynomials on semi-algebraic sets
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Semidefinite representations for finite varieties
- Solution du problème des moments par extension dimensionnelle
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Sparse noncommutative polynomial optimization
- Sparse polynomial optimisation for neural network verification
- Sparse Polynomial Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
- Survey of Numerical Methods for Trajectory Optimization
- Tangencies and polynomial optimization
- The Forced van der Pol Equation I: The Slow Flow and Its Bifurcations
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Truncated \(K\)-moment problems in several variables
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Cited in
(3)
This page was built for publication: Sparse polynomial optimization with unbounded sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994535)
