Some LCPs solvable in strongly polynomial time with Lemke's algorithm.
Ilan AdlerRichard W. CottleJong-Shi PangPublished in: Math. Program. (2016)
Keyphrases
- computational complexity
- np hard
- preprocessing
- worst case
- dynamic programming
- theoretical analysis
- cost function
- improved algorithm
- k means
- times faster
- learning algorithm
- detection algorithm
- optimization algorithm
- special case
- experimental evaluation
- computational cost
- simulated annealing
- path planning
- optimal solution
- strongly polynomial
- segmentation algorithm
- computationally efficient
- expectation maximization
- particle swarm optimization
- denoising
- significant improvement
- data structure