Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems
https://epubs.siam.org/doi/abs/10.1137/130945442Publisher, magazine: ,
Publication year: 2014
Lưu Trích dẫn Chia sẻAbstract
We present algorithms for solving a number of new models of facility location which generalize the classical Fermat--Torricelli problem. Our first approach involves using Nesterov's smoothing technique and the minimization majorization principle to build smooth approximations that are convenient for applying smooth optimization schemes. Another approach uses subgradient-type algorithms to cope directly with the nondifferentiability of the cost functions. Convergence results of the algorithms are proved and numerical tests are presented to show the effectiveness of the proposed algorithms.
Tags: MM principle, Nesterov’s smoothing technique, Nesterov’s accelerated gradient method, generalized Fermat–Torricelli problem, subgradient-type algorithms
Các bài viết liên quan đến tác giả Nguyễn Mậu Nam
Relationships between approximate Jacobians and coderivatives
Frechet subdifferential calculus and optimality conditions in nondifferentiable programming
Subgradients of marginal functions in parametric mathematical programming
A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets
Solving k-center problems involving sets based on optimization techniques
Convergence analysis of a proximal point algorithm for minimizing differences of functions
Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems