An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex.
Etienne de KlerkMonique LaurentZhao SunPublished in: Math. Program. (2015)
Keyphrases
- optimization algorithm
- optimization problems
- optimization process
- low degree
- discrete optimization
- constrained optimization
- global optimization
- linear programming
- linear program
- data sets
- approximation algorithms
- theorem prover
- evolutionary algorithm
- multiple objectives
- genetic algorithm
- simplex algorithm
- neural network