Pages that link to "Item:Q2018474"

The following pages link to A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474):

Displaying 18 items.

• New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
• Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering (Q1749775) (← links)
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
• Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
• An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
• An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms (Q2244241) (← links)
• On strategies to fix degenerate \(k\)-means solutions (Q2403298) (← links)
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
• A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions (Q5099775) (← links)
• Qualitative properties of the minimum sum-of-squares clustering problem (Q5121778) (← links)
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
• Latent group detection in functional partially linear regression models (Q6079865) (← links)
• A bundle-type method for nonsmooth DC programs (Q6154409) (← links)
• A novel optimization approach towards improving separability of clusters (Q6164339) (← links)
• A boosted DC algorithm for non-differentiable DC components with non-monotone line search (Q6568924) (← links)