Pages that link to "Item:Q2386076"
From MaRDI portal
The following pages link to Distinguished representations of non-negative polynomials (Q2386076):
Displaying 19 items.
- Nonnegative Morse polynomial functions and polynomial optimization (Q291995) (← links)
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- Some positivstellensätze for polynomial matrices (Q496788) (← links)
- Semidefinite representation of convex sets (Q847843) (← links)
- On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Convergent conic linear programming relaxations for cone convex polynomial programs (Q1728215) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- The membership problem for finitely generated quadratic modules in the univariate case (Q1934974) (← links)
- Polynomials of almost normal arguments in \(C^*\)-algebras (Q1943737) (← links)
- On the exactness of Lasserre relaxations and pure states over real closed fields (Q2007851) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Positivstellensätze for polynomial matrices (Q2055381) (← links)
- Representations of non-negative polynomials having finitely many zeros (Q2372654) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- Non-existence of degree bounds for weighted sums of squares representations (Q2577530) (← links)
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
- Degree Bounds for Putinar’s Positivstellensatz on the Hypercube (Q6202884) (← links)