IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-03665851.html
   My bibliography  Save this paper

Coercivity and generalized proximal algorithms: application—traveling around the world

Author

Listed:
  • Erik Alex Papa Quiroz

    (UNMSM - Universidad Nacional Mayor de San Marcos, Universidad Privada del Norte, UFG - Universidade Federal de Goiás [Goiânia])

  • Antoine Soubeyran

    (AMSE - Aix-Marseille Sciences Economiques - EHESS - École des hautes études en sciences sociales - AMU - Aix Marseille Université - ECM - École Centrale de Marseille - CNRS - Centre National de la Recherche Scientifique)

  • Paulo Roberto Oliveira

    (PESC/COPPE-UFRJ - Programa de Engenharia de Sistemas e Computação - COPPE-UFRJ - Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia - UFRJ - Universidade Federal do Rio de Janeiro [Brasil] = Federal University of Rio de Janeiro [Brazil] = Université fédérale de Rio de Janeiro [Brésil])

Abstract

We present an inexact proximal point algorithm using quasi distances to solve a minimization problem in the Euclidean space. This algorithm is motivated by the proximal methods introduced by Attouch et al., section 4, (Math Program Ser A, 137: 91–129, 2013) and Solodov and Svaiter (Set Valued Anal 7:323–345, 1999). In contrast, in this paper we consider quasi distances, arbitrary (non necessary smooth) objective functions, scalar errors in each objective regularized approximation and vectorial errors on the residual of the regularized critical point, that is, we have an error on the optimality condition of the proximal subproblem at the new point. We obtain, under a coercivity assumption of the objective function, that all accumulation points of the sequence generated by the algorithm are critical points (minimizer points in the convex case) of the minimization problem. As an application we consider a human location problem: How to travel around the world and prepare the trip of a lifetime.

Suggested Citation

  • Erik Alex Papa Quiroz & Antoine Soubeyran & Paulo Roberto Oliveira, 2023. "Coercivity and generalized proximal algorithms: application—traveling around the world," Post-Print hal-03665851, HAL.
    • Handle: RePEc:hal:journl:hal-03665851
    DOI: 10.1007/s10479-022-04725-0
    Note: View the original document on HAL open archive server: https://amu.hal.science/hal-03665851
    as

    Download full text from publisher

    File URL: https://amu.hal.science/hal-03665851/document
    Download Restriction: no
    File URL: https://libkey.io/10.1007/s10479-022-04725-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Erik Papa Quiroz & Antoine Soubeyran, 2024. "Local proximal algorithms in Riemannian manifolds: Application to the behavioral traveler's problem," Post-Print hal-04930974, HAL.

    More about this item

    Keywords

    Proximal point methods; Inexact algorithms; Coercivity; Quasi distances; Variational rationality; Traveler problem;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-03665851. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.