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 3 items.
- 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)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
