Pages that link to "Item:Q263184"
From MaRDI portal
The following pages link to A dynamic inequality generation scheme for polynomial programming (Q263184):
Displaying 6 items.
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- 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)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
