Pages that link to "Item:Q5378276"
From MaRDI portal
The following pages link to Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms (Q5378276):
Displaying 14 items.
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms (Q477981) (← links)
- Self-organizing maps by difference of convex functions optimization (Q736509) (← links)
- A fast permuation-based algorithm for block clustering (Q1382953) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A novel heuristic algorithm to solve penalized regression-based clustering model (Q2153681) (← links)
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
- A new efficient algorithm based on DC programming and DCA for clustering (Q2385500) (← links)
- Optimization based DC programming and DCA for hierarchical clustering (Q2643938) (← links)
- Clustering via d. c. optimization. (Q2768045) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
- Efficient Nonnegative Matrix Factorization by DC Programming and DCA (Q5380443) (← links)
- Sparse Covariance Matrix Estimation by DCA-Based Algorithms (Q5380866) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
