Clustering and multifacility location with constraints via distance function penalty methods and DC programming
From MaRDI portal
Publication:4646536
DOI10.1080/02331934.2018.1510498zbMATH Open1411.49016OpenAlexW2807943547WikidataQ129300742 ScholiaQ129300742MaRDI QIDQ4646536FDOQ4646536
Authors: Nguyen Mau Nam, Nguyen Thai An, S. Reynolds, T. Tran
Publication date: 14 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1160&context=studentsymposium
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
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convex Analysis
- Distance majorization and its applications
- Title not available (Why is that?)
- An easy path to convex analysis and applications
- A new efficient algorithm based on DC programming and DCA for clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Geometric approach to convex subdifferential calculus
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- Minimizing differences of convex functions with applications to facility location and clustering
Cited In (4)
Uses Software
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)