Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems

DOI10.1137/130945442zbMath1318.49058OpenAlexW2016902490MaRDI QIDQ5245367

Nguyen Mau Nam, R. Blake Rector, Nguyen Thai An, Jie Sun

Publication date: 8 April 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11937/2852

zbMATH Keywords

Nesterov's accelerated gradient methodNesterov's smoothing techniquesubgradient-type algorithmsgeneralized Fermat-Torricelli problemsminimization-majorization principle

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)

Related Items (8)

The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems ⋮ Solving a continuous multifacility location problem by DC algorithms ⋮ Minimizing differences of convex functions with applications to facility location and clustering ⋮ Multivariate Monotone Inclusions in Saddle Form ⋮ Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets ⋮ Error minimization with global optimization for difference of convex functions ⋮ Unnamed Item ⋮ The minimal time function associated with a collection of sets

This page was built for publication: Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems