Local proximal algorithms in Riemannian manifolds: Application to the behavioral traveler's problem

Erik Papa Quiroz and Antoine Soubeyran
Additional contact information
Erik Papa Quiroz: UFG - Universidade Federal de Goiás [Goiânia], PUCP - Pontificia Universidad Católica del Perú = Pontifical Catholic University of Peru

Post-Print from HAL

Abstract: Local proximal point algorithms with quasi distances to find critical points (or minimizer points in the convex case) of functions in finite dimensional Riemannian manifolds are introduced. We prove that bounded sequences of the algorithm generated by proper bounded from below, lower semicontinuous and locally Lipschitz functions have accumulation points which are critical points (minimizer points in the convex case). Moreover, for KurdykaLojasiewicz functions, the sequence globally converges to a critical point. We applied the algorithm to a behavioral traveler's problem where an individual tries to satisfy locally his needs and desires by moving from one city to the next, with costs to move playing a major role.

Keywords: Local search; proximal algorithms; Riemannian manifolds; the behavioral traveler’s problem (search for similar items in EconPapers)
Date: 2024
Note: View the original document on HAL open archive server: https://hal.science/hal-04930974v1
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Evolution Equations and Control Theory, inPress, ⟨10.3934/eect.2024072⟩

Downloads: (external link)
https://hal.science/hal-04930974v1/document (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-04930974

DOI: 10.3934/eect.2024072

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().