6533b82bfe1ef96bd128e04b

RESEARCH PRODUCT

A Proximal Solution for a Class of Extended Minimax Location Problem

Oscar CornejoCristian Michelot

subject

Mathematical optimizationClass (set theory)Optimality criterionComputer scienceScheme (mathematics)1-center problemRegular polygonMinimax problemConstruct (python library)Variety (universal algebra)Minimax

description

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.

yearjournalcountryeditionlanguage
2005-01-01
https://doi.org/10.1007/11424925_75