Your selections:
New diagonal bundle method for clustering problems in large data sets
- Karmitsa, Napsu, Bagirov, Adil, Taheri, Sona
Clustering in large data sets with the limited memory bundle method
- Karmitsa, Napsu, Bagirov, Adil, Taheri, Sona
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Bagirov, Adil, Taheri, Sona, Ugon, Julien
A difference of convex optimization algorithm for piecewise linear regression
- Bagirov, Adil, Taheri, Sona, Asadi, Soodabeh
Double bundle method for finding clarke stationary points in nonsmooth dc programming
- Joki, Kaisa, Bagirov, Adil, Karmitsa, Napsu, Makela, Marko, Taheri, Sona
DC programming algorithm for clusterwise linear L1 regression
Are you sure you would like to clear your session, including search history and login status?