Pages that link to "Item:Q604960"
From MaRDI portal
The following pages link to Partitioning procedure for polynomial optimization (Q604960):
Displaying 5 items.
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- A robust unscented transformation for uncertain moments (Q1738657) (← links)
- Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
