Pages that link to "Item:Q2416961"
From MaRDI portal
The following pages link to Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961):
Displayed 8 items.
- 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)
- 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)