Publicación:
A Proximal Method to Solve Quasiconvex Non-differentiable Location Problems

dc.contributor.authorAngel Cano Lengua, Miguel Angel
dc.contributor.authorPapa Quiroz, E. A.
dc.date.accessioned2025-09-05T16:38:36Z
dc.description.abstractThe 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. © 2022 Elsevier B.V., All rights reserved.
dc.identifier.doi10.1145/3404716.3404735
dc.identifier.isbn9781450385855
dc.identifier.scopus2-s2.0-85092378386
dc.identifier.urihttps://cris.uwiener.edu.pe/handle/001/1075
dc.identifier.uuidf4ec37c1-4ed5-4857-a44c-a17a3a1ce996
dc.language.isoen
dc.publisherAssociation for Computing Machinery
dc.relation.ispartofseriesACM International Conference Proceeding Series
dc.rightshttp://purl.org/coar/access_right/c_14cb
dc.titleA Proximal Method to Solve Quasiconvex Non-differentiable Location Problems
dc.typehttp://purl.org/coar/resource_type/c_f744
dspace.entity.typePublication
oaire.citation.endPage104
oaire.citation.startPage98

Archivos

Colecciones