Pages that link to "Item:Q1733314"
From MaRDI portal
The following pages link to Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314):
Displaying 10 items.
- univsos (Q39907) (← links)
- On sum of squares certificates of non-negativity on a strip (Q1996082) (← links)
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions (Q2351490) (← links)
- SONC optimization and exact nonnegativity certificates via second-order cone programming (Q2674014) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- Convergence of a Constrained Vector Extrapolation Scheme (Q5089736) (← links)
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
- Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size (Q6051120) (← links)
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938) (← links)
- Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares (Q6081964) (← links)
