Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
From MaRDI portal
Publication:1749775
DOI10.1007/s11590-017-1183-0zbMath1418.90203arXiv1701.04464OpenAlexW2571624366MaRDI QIDQ1749775
T. Tran, S. Reynolds, W. Geremew, Nguyen Mau Nam
Publication date: 28 May 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04464
Related Items (7)
Solving a continuous multifacility location problem by DC algorithms ⋮ The boosted DC algorithm for linearly constrained DC programming ⋮ Minimax D-optimal designs for multivariate regression models with multi-factors ⋮ Unnamed Item ⋮ Clustering and multifacility location with constraints via distance function penalty methods and dc programming ⋮ A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
Uses Software
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- Gradient methods for minimizing composite functions
- On functions representable as a difference of convex functions
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- A new efficient algorithm based on DC programming and DCA for clustering
- Minimizing differences of convex functions with applications to facility location and clustering
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Optimization based DC programming and DCA for hierarchical clustering
- TSPLIB—A Traveling Salesman Problem Library
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Convex Analysis
This page was built for publication: Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
