On the complexity of optimization over the standard simplex

  • Etienne de Klerk
  • Dick den Hertog
  • Gamal Elabwabi
    • Categories Global Optimization Theory, Linear, Cone and Semidefinite Programming Tags , , , , Short URL: https://optimization-online.org/?p=9874

    We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we show that there exists a polynomial time approximation scheme (PTAS) for minimizing some classes of functions (including Lipschitz continuous functions) over the standard simplex. The main tools used in the analysis are Bernstein approximation and Lagrange interpolation on the simplex combined with an earlier result by De Klerk, Laurent and Parrilo [A PTAS for the minimization of polynomials of fixed degree over the simplex, Theoretical Computer Science, to appear.]

    Citation

    CentER Discussion paper 2005-125, Tilburg University.

    Article

    Download

    View On the complexity of optimization over the standard simplex