Nonsmooth algorithms and Nesterov's smoothing technique for generalized Fermat-Torricelli problems
From MaRDI portal
Publication:5245367
Recommendations
- Minimizing differences of convex functions with applications to facility location and clustering
- scientific article; zbMATH DE number 1159474
- On Newton's method for the Fermat-Weber location problem
- Applications of variational analysis to a generalized Fermat-Torricelli problem
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
Cited in
(9)- Minimizing differences of convex functions with applications to facility location and clustering
- Multivariate Monotone Inclusions in Saddle Form
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- Applications of variational analysis to a generalized Fermat-Torricelli problem
- Error minimization with global optimization for difference of convex functions
- Solving a continuous multifacility location problem by DC algorithms
- scientific article; zbMATH DE number 7312307 (Why is no real title available?)
- The minimal time function associated with a collection of sets
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
This page was built for publication: Nonsmooth algorithms and Nesterov's smoothing technique for generalized Fermat-Torricelli problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5245367)