Pages that link to "Item:Q2503350"
From MaRDI portal
The following pages link to A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350):
Displayed 7 items.
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- Impossibility of extending Pólya's theorem to ``forms'' with arbitrary real exponents (Q949641) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)