Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.
Sara AhmadianAshkan Norouzi-FardOla SvenssonJustin WardPublished in: SIAM J. Comput. (2020)
Keyphrases
- primal dual
- interior point
- linear programming
- k means
- simplex algorithm
- optimization problems
- approximation algorithms
- computational complexity
- convex optimization problems
- linear program
- data clustering
- interior point methods
- linear programming problems
- convex optimization
- clustering method
- convex programming
- algorithm for linear programming
- convex functions
- computationally intensive
- convergence rate
- worst case
- wavelet transform
- upper bound
- pairwise