A proximal solution for a class of extended minimax location problem
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 s...
Autor Principal: | Cornejo Zúñiga, Oscar |
---|---|
Otros Autores: | Michelot, Cristian |
Formato: | Artículo |
Idioma: | English |
Publicado: |
Springer
2015
|
Materias: | |
Acceso en línea: |
Computational Science and Its Applications – ICCSA 2005 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sumario: |
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. |
---|