On Some Incremental Algorithms for the Minimum Sum-of-Squares Clustering Problem. Part 1: Ordin and Bagirov's Incremental Algorithm
From MaRDI portal
Publication:4988109
zbMath1468.90092arXiv1901.10151MaRDI QIDQ4988109
Tran Hung Cuong, Jen-Chih Yao, Nguyen Dong Yen
Publication date: 11 May 2021
Full work available at URL: https://arxiv.org/abs/1901.10151
DCAconvergenceglobal solution\(k\)-means algorithmlocal solutionincremental algorithmminimum sum-of-squares clustering problem
Nonconvex programming, global optimization (90C26) Regularity of solutions in optimal control (49N60) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
This page was built for publication: On Some Incremental Algorithms for the Minimum Sum-of-Squares Clustering Problem. Part 1: Ordin and Bagirov's Incremental Algorithm
