Pages that link to "Item:Q2349131"

The following pages link to An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131):

Displaying 11 items.

• A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← links)
• Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← links)
• On the convergence rate of grid search for polynomial optimization over the simplex (Q519777) (← links)
• FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
• Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
• A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
• The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (Q2829586) (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
• An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
• Approximating the existential theory of the reals (Q5918470) (← links)
• Approximating the existential theory of the reals (Q5918881) (← links)