A Sampling Kaczmarz-Motzkin Algorithm for Linear Feasibility.
Jesús A. De LoeraJamie HaddockDeanna NeedellPublished in: SIAM J. Sci. Comput. (2017)
Keyphrases
- dynamic programming
- k means
- learning algorithm
- sampling algorithm
- expectation maximization
- high accuracy
- worst case
- computational complexity
- optimal solution
- objective function
- similarity measure
- preprocessing
- significant improvement
- np hard
- computational cost
- optimization algorithm
- theoretical analysis
- linear complexity
- neural network
- improved algorithm
- times faster
- matching algorithm
- simulated annealing
- experimental evaluation
- cost function
- segmentation algorithm
- detection algorithm
- clustering method
- tree structure
- data structure
- sampling methods
- special case
- provably convergent