Pages that link to "Item:Q511965"
From MaRDI portal
The following pages link to Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965):
Displaying 9 items.
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
- Convergent conic linear programming relaxations for cone convex polynomial programs (Q1728215) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES (Q4446317) (← links)
- Polynomial Programming: LP-Relaxations Also Converge (Q5317502) (← links)
- Sum of squares generalizations for conic sets (Q6038674) (← links)
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)