Pages that link to "Item:Q2287850"
From MaRDI portal
The following pages link to Alternative SDP and SOCP approximations for polynomial optimization (Q2287850):
Displaying 7 items.
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Sum of squares basis pursuit with linear and second order cone programming (Q2979646) (← links)
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
- New Dependencies of Hierarchies in Polynomial Optimization (Q5121114) (← links)
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938) (← links)