IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v321y2023i1d10.1007_s10479-022-04725-0.html
   My bibliography  Save this article

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

Author

Listed:
  • E. A. Papa Quiroz

    (Universidad Nacional Mayor de San Marcos
    Universidad Privada del Norte
    Universidade Federal de Goiás)

  • A. Soubeyran

    (Aix-Marseille University)

  • P. R. Oliveira

    (Federal University of Rio de Janeiro)

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

  • E. A. Papa Quiroz & A. Soubeyran & P. R. Oliveira, 2023. "Coercivity and generalized proximal algorithms: application—traveling around the world," Annals of Operations Research, Springer, vol. 321(1), pages 451-467, February.
    • Handle: RePEc:spr:annopr:v:321:y:2023:i:1:d:10.1007_s10479-022-04725-0
    DOI: 10.1007/s10479-022-04725-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04725-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Levin, V. L., 1991. "Some applications of set-valued mappings in mathematical economics," Journal of Mathematical Economics, Elsevier, vol. 20(1), pages 69-87.
    2. Truong Quang Bao & Antoine Soubeyran, 2019. "Variational principles in set optimization with domination structures and application to changing jobs," Post-Print hal-02497051, HAL.
    3. G. C. Bento & A. Soubeyran, 2015. "Generalized Inexact Proximal Algorithms: Routine’s Formation with Resistance to Change, Following Worthwhile Changes," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 172-187, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. João Carlos O. Souza & Paulo Roberto Oliveira & Antoine Soubeyran, 2016. "Global convergence of a proximal linearized algorithm for difference of convex functions," Post-Print hal-01440298, HAL.
    2. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    3. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01169552, HAL.
    4. Glaydston Carvalho Bento & João Xavier Cruz Neto & Antoine Soubeyran & Valdinês Leite Sousa Júnior, 2016. "Dual Descent Methods as Tension Reduction Systems," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 209-227, October.
    5. J. X. Cruz Neto & J. O. Lopes & A. Soubeyran & J. C. O. Souza, 2022. "Abstract regularized equilibria: application to Becker’s household behavior theory," Annals of Operations Research, Springer, vol. 316(2), pages 1279-1300, September.
    6. Asier Estevan & Roberto Maura & Oscar Valero, 2024. "Intergenerational Preferences and Continuity: Reconciling Order and Topology," Papers 2402.01699, arXiv.org.
    7. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    8. Glaydston Carvalho Bento & Sandro Dimy Barbosa Bitar & João Xavier Cruz Neto & Antoine Soubeyran & João Carlos Oliveira Souza, 2020. "A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems," Computational Optimization and Applications, Springer, vol. 75(1), pages 263-290, January.
    9. Asier Estevan & Roberto Maura & Óscar Valero, 2023. "Quasi-Metrics for Possibility Results: Intergenerational Preferences and Continuity," Mathematics, MDPI, vol. 11(2), pages 1-19, January.
    10. Levin, Vladimir L., 1997. "Reduced cost functions and their applications," Journal of Mathematical Economics, Elsevier, vol. 28(2), pages 155-186, September.
    11. Levin, Vladimir L., 2010. "On social welfare functionals: Representation theorems and equivalence classes," Mathematical Social Sciences, Elsevier, vol. 59(3), pages 299-305, May.
    12. Paolo Scapparone, 1999. "Existence of a convex extension of a preference relation," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 22(1), pages 5-11, March.
    13. Maćkowiak, Piotr, 2004. "Uniform boundedness of feasible per capita output streams under convex technology and non-stationary labor," MPRA Paper 41891, University Library of Munich, Germany.
    14. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Documents de travail du Centre d'Economie de la Sorbonne 15053, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.

    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:spr:annopr:v:321:y:2023:i:1:d:10.1007_s10479-022-04725-0. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.