Resumen
The location problem is of great interest in order to establish different location demands in the state or private sector. The model of this problem is usually reduced to a mathematical optimization problem. In this paper we present a proximal method to solve location problems where the objective function is quasi-convex and non-differentiable. We prove that the iterations given by the method are well defined and under some assumptions on the objective function we prove the convergence of the method.
Idioma original | Inglés |
---|---|
Título de la publicación alojada | Proceedings of the 2020 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 |
Editorial | Association for Computing Machinery |
Páginas | 98-104 |
Número de páginas | 7 |
ISBN (versión digital) | 9781450377485 |
DOI | |
Estado | Publicada - 28 may. 2020 |
Publicado de forma externa | Sí |
Evento | 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 - Chengdu, China Duración: 28 may. 2020 → 30 may. 2020 |
Serie de la publicación
Nombre | ACM International Conference Proceeding Series |
---|
Conferencia
Conferencia | 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 |
---|---|
País/Territorio | China |
Ciudad | Chengdu |
Período | 28/05/20 → 30/05/20 |
Nota bibliográfica
Publisher Copyright:© 2020 ACM.