Pages that link to "Item:Q944212"
From MaRDI portal
The following pages link to Representation of nonnegative convex polynomials (Q944212):
Displaying 13 items.
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- Positivstellensatz for homogeneous semialgebraic sets (Q895800) (← links)
- Representing polynomials by positive linear functions on compact convex polyhedra (Q1112337) (← links)
- Complexity estimates for representations of Schmüdgen type. (Q1599208) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Distinguished representations of non-negative polynomials (Q2386076) (← links)
- Distinguished representations of strictly positive polynomials (Q2706832) (← links)
- Representation of a polynomial function as a difference of convex polynomials, with an application (Q2751334) (← links)
- Convexifying Positive Polynomials and Sums of Squares Approximation (Q3457192) (← links)
- Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)
