We propose a proximal approach for solving a wide class of minimax location problems which in particular contains the round trip location problem. We show that a suitable reformulation of the problem allows to construct a Fenchel duality scheme the primal-dual optimality conditions of which can be solved by a proximal algorithm. This approach permits to solve problems for which distances are measured by mixed norms or gauges and to handle a large variety of convex constraints. Several numerical results are presented. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Cornejo, O., & Michelot, C. (2005). A proximal solution for a class of extended minimax location problem. In Lecture Notes in Computer Science (Vol. 3483, pp. 712–721). Springer Verlag. https://doi.org/10.1007/11424925_75
Mendeley helps you to discover research relevant for your work.