A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation.
Simon TelenMarc Van BarelJan VerscheldePublished in: SIAM J. Sci. Comput. (2020)
Keyphrases
- computationally efficient
- dynamic programming
- cost function
- object tracking algorithm
- parameter tuning
- computational complexity
- np hard
- learning algorithm
- optimization algorithm
- computational cost
- k means
- search space
- detection algorithm
- path planning
- target tracking
- optimal solution
- convergence rate
- kalman filter
- real time
- robust tracking
- optimal path
- face recognition
- visual tracking
- object tracking
- segmentation algorithm
- particle swarm optimization
- linear programming
- simulated annealing
- worst case