Pages that link to "Item:Q2419540"
From MaRDI portal
The following pages link to A new approximation hierarchy for polynomial conic optimization (Q2419540):
Displaying 7 items.
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
- New Dependencies of Hierarchies in Polynomial Optimization (Q5121114) (← links)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)