Pages that link to "Item:Q5317732"

The following pages link to An algorithm for minimizing clustering functions (Q5317732):

Displaying 10 items.

• A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
• New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474) (← links)
• An incremental clustering algorithm based on hyperbolic smoothing (Q2340498) (← links)
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
• Classes and clusters in data analysis (Q2497269) (← links)
• Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization (Q2501110) (← links)
• Transversality condition and optimization of higher order ordinary differential inclusions (Q3454859) (← links)
• Center-based l1–clustering method (Q5494418) (← links)
• A novel optimization approach towards improving separability of clusters (Q6164339) (← links)