Exact moment representation in polynomial optimization
From MaRDI portal
Cites work
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A criterion for detecting m-regularity
- A generalized flat extension theorem for moment matrices
- An exact Jacobian SDP relaxation for polynomial optimization
- An introduction to polynomial and semi-algebraic optimization
- Border basis relaxation for polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Computing real radicals by moment optimization
- Convex Computation of the Region of Attraction of Polynomial Control Systems
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
- Distinguished representations of non-negative polynomials
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- Flat extensions of positive moment matrices: recursively generated relations
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1944285 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Minimizing polynomials via sum of squares over the gradient ideal
- Moment matrices, border bases and real radical computation
- Moments, positive polynomials and their applications
- Non-existence of degree bounds for weighted sums of squares representations
- On the Convergence of the Central Path in Semidefinite Optimization
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization of Polynomial Functions
- Polynomial optimization with real varieties
- Polynomial-exponential decomposition from moments
- Positive polynomials and sums of squares
- Positive polynomials on compact sets
- Representations of non-negative polynomials having finitely many zeros
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Semidefinite representations for finite varieties
- Strong duality in lasserre's hierarchy for polynomial optimization
- Sums of squares of regular functions on real algebraic varieties
- Sums of squares on real algebraic surfaces
- Sums of squares, moment matrices and optimization over polynomials
- The Geometry of Syzygies
- The moment problem
- Truncated \(K\)-moment problems in several variables
Cited in
(2)
This page was built for publication: Exact moment representation in polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030688)
