Pages that link to "Item:Q2416961"

The following pages link to Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961):

Displaying 28 items.

• Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms (Q477981) (← links)
• On the solution of min-sum-min problems (Q813350) (← links)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
• New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
• DC programming algorithm for clusterwise linear \(L_1\) regression (Q1706682) (← 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 DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
• Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• K-means clustering via a nonconvex optimization approach (Q2117651) (← 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)
• A difference of convex optimization algorithm for piecewise linear regression (Q2313774) (← links)
• Minimizing differences of convex functions with applications to facility location and clustering (Q2401517) (← links)
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
• Clustering via d. c. optimization. (Q2768045) (← links)
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
• Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
• Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (Q4638918) (← links)
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
• (Q5866396) (← links)
• Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering (Q6071251) (← links)
• A novel optimization approach towards improving separability of clusters (Q6164339) (← links)
• Directional differentiability, coexhausters, codifferentials and polyhedral DC functions (Q6166026) (← links)
• A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering (Q6488346) (← links)
• On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)