A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets

zbMath1342.49049arXiv1404.5113MaRDI QIDQ2814272

Nguyen Mau Nam, Nguyen Thai An, Nguyen Dong Yen

Publication date: 21 June 2016

Full work available at URL: https://arxiv.org/abs/1404.5113

zbMATH Keywords

d.c. programmingWeiszfeld algorithmnonconvex location problemPham Dinh-Le Thi algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

Minsum location extended to gauges and to convex sets

This page was built for publication: A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets