An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions.
Thanh Hieu LeMarc Van BarelPublished in: Numer. Algorithms (2015)
Keyphrases
- dynamic programming
- expectation maximization
- learning algorithm
- computational cost
- objective function
- experimental evaluation
- segmentation algorithm
- computational complexity
- computationally efficient
- linear programming
- cost function
- matching algorithm
- optimization algorithm
- times faster
- worst case
- np hard
- significant improvement
- convex hull
- convergence rate
- improved algorithm
- estimation algorithm
- path planning
- simulated annealing
- clustering method
- detection algorithm
- high accuracy
- k means
- feature space
- optimal solution
- decision making