K-means-type algorithms: a generalized convergence theorem and characterization of local optimality
Related Experiment Video
Updated: May 29, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
Published on: March 1, 2022
1Department of Systems Engineering, University of Petroleum and Minerals, Dhahran, Saudi Arabia.
Abstract:
The K-means algorithm is a commonly used technique in cluster analysis. In this paper, several questions about the algorithm are addressed. The clustering problem is first cast as a nonconvex mathematical program. Then, a rigorous proof of the finite convergence of the K-means-type algorithm is given for any metric. It is shown that under certain conditions the algorithm may fail to converge to a local minimum, and that it converges under differentiability conditions to a Kuhn-Tucker point. Finally, a method for obtaining a local-minimum solution is given.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Application of Linearization and Approximation
Chebyshev's Theorem to Interpret Standard Deviation
The Mean Value Theorem
Central Limit Theorem
The sample size, n, that...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
