Nonsmooth algorithms and Nesterov’s smoothing technique for generalized Fermat–Torricelli problems
MetadataShow full item record
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.
Copyright © 2014 Society for Industrial and Applied Mathematics. Reproduced with permission
Showing items related by title, author, creator and subject.
Li, J.; Wu, Changzhi; Wu, Z.; Long, Q. (2015)In this paper, we consider a distributed nonsmooth optimization problem over a computational multi-agent network. We first extend the (centralized) Nesterov’s random gradient-free algorithm and Gaussian smoothing technique ...
A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimizationWang, G.; Yu, C.; Teo, Kok Lay (2013)In this paper, we generalize the classical primal–dual logarithmic barrier method for linear optimization to convex quadratic optimization over symmetric cone by using Euclidean Jordan algebras. The symmetrization of the ...
Li, Bin (2011)In this thesis, we consider several types of optimal control problems with constraints on the state and control variables. These problems have many engineering applications. Our aim is to develop efficient numerical methods ...