A note on overrelaxation in the Sinkhorn algorithm.
Tobias LehmannMax-K. von RenesseAlexander SambaleAndré UschmajewPublished in: Optim. Lett. (2022)
Keyphrases
- experimental evaluation
- computational complexity
- k means
- matching algorithm
- expectation maximization
- learning algorithm
- preprocessing
- search space
- improved algorithm
- dynamic programming
- optimization algorithm
- estimation algorithm
- recognition algorithm
- convergence rate
- detection algorithm
- np hard
- cost function
- tree structure
- high accuracy
- path planning
- worst case
- neural network