Login / Signup

A PTAS for the minimization of polynomials of fixed degree over the simplex.

Etienne de KlerkMonique LaurentPablo A. Parrilo
Published in: Theor. Comput. Sci. (2006)
Keyphrases
  • approximation algorithms
  • simplex algorithm
  • databases
  • neural network
  • linear programming
  • approximation schemes
  • optimal solution
  • d objects
  • pose estimation
  • fixed number
  • low order
  • simplex method