Clustering and multifacility location with constraints via distance function penalty methods and DC programming
From MaRDI portal
Publication:4646536
Recommendations
- Minimizing differences of convex functions with applications to facility location and clustering
- Solving a continuous multifacility location problem by DC algorithms
- A DC optimization approach for constrained clustering with \(\ell_1\)-norm
- Optimization based DC programming and DCA for hierarchical clustering
- scientific article; zbMATH DE number 970362
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A new efficient algorithm based on DC programming and DCA for clustering
- An easy path to convex analysis and applications
- Convex Analysis
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Distance majorization and its applications
- Geometric approach to convex subdifferential calculus
- Minimizing differences of convex functions with applications to facility location and clustering
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- TSPLIB—A Traveling Salesman Problem Library
Cited in
(4)
This page was built for publication: Clustering and multifacility location with constraints via distance function penalty methods and DC programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646536)