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

Dual Descent Methods as Tension Reduction Systems

Author

Listed:
  • Glaydston de Carvalho Bento

    (UFG - Universidade Federal de Goiás [Goiânia])

  • João Xavier da Cruz Neto

    (UFPI - Universidade Federal do Piauí)

  • 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)

  • Valdinês Leite de Sousa Júnior

    (UFG - Universidade Federal de Goiás [Goiânia])

Abstract

In this paper, driven by applications in Behavioral Sciences, wherein the speed of convergence matters considerably, we compare the speed of convergence of two descent methods for functions that satisfy the well-known Kurdyka–Lojasiewicz property in a quasi-metric space. This includes the extensions to a quasi-metric space of both the primal and dual descent methods. While the primal descent method requires the current step to be more or less half of the size of the previous step, the dual approach considers more or less half of the previous decrease in the objective function to be minimized. We provide applications to the famous "Tension systems approach" in Psychology.

Suggested Citation

  • Glaydston de Carvalho Bento & João Xavier da Cruz Neto & Antoine Soubeyran & Valdinês Leite de Sousa Júnior, 2016. "Dual Descent Methods as Tension Reduction Systems," Post-Print hal-01690176, HAL.
    • Handle: RePEc:hal:journl:hal-01690176
    DOI: 10.1007/s10957-016-0994-y
    Note: View the original document on HAL open archive server: https://amu.hal.science/hal-01690176
    as

    Download full text from publisher

    File URL: https://amu.hal.science/hal-01690176/document
    Download Restriction: no
    File URL: https://libkey.io/10.1007/s10957-016-0994-y?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:

    References listed on IDEAS

    as
    1. Hédy Attouch & Jérôme Bolte & Patrick Redont & Antoine Soubeyran, 2010. "Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 438-457, May.
    2. J. Y. Bello Cruz & G. Bouza Allende, 2014. "A Steepest Descent-Like Method for Variable Order Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 371-391, August.
    3. T. Q. Bao & B. S. Mordukhovich & A. Soubeyran, 2015. "Variational Analysis in Psychological Modeling," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 290-315, January.
    4. Marc Fuentes & Jérôme Malick & Claude Lemaréchal, 2012. "Descentwise inexact proximal algorithms for smooth optimization," Computational Optimization and Applications, Springer, vol. 53(3), pages 755-769, December.
    5. 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.
    6. Truong Q. Bao & Boris S. Mordukhovich & Antoine Soubeyran, 2015. "Minimal points, variational principles, and variable preferences in set optimization," Post-Print hal-01457319, HAL.
    7. Glaydston Carvalho Bento & João Xavier Cruz Neto & Paulo Roberto Oliveira, 2016. "A New Approach to the Proximal Point Method: Convergence on General Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 743-755, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Glaydston de Carvalho Bento & Orizon Pereira Ferreira & Antoine Soubeyran & Valdinês Leite de Sousa Júnior, 2018. "Inexact Multi-Objective Local Search Proximal Algorithms: Application to Group Dynamic and Distributive Justice Problems," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 181-200, April.

    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. 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.
    2. Truong Q. Bao & Antoine Soubeyran, 2016. "Variational Analysis in Cone Pseudo-Quasimetric Spaces and Applications to Group Dynamics," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 458-475, August.
    3. Erik Papa Quiroz & Antoine Soubeyran, 2024. "Local proximal algorithms in Riemannian manifolds: Application to the behavioral traveler's problem," Post-Print hal-04930974, HAL.
    4. Glaydston Carvalho Bento & Gemayqzel Bouza Allende & Yuri Rafael Leite Pereira, 2018. "A Newton-Like Method for Variable Order Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 201-221, April.
    5. T. Q. Bao & S. Cobzaş & A. Soubeyran, 2018. "Variational principles, completeness and the existence of traps in behavioral sciences," Annals of Operations Research, Springer, vol. 269(1), pages 53-79, October.
    6. Maryam Yashtini, 2022. "Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization," Journal of Global Optimization, Springer, vol. 84(4), pages 913-939, December.
    7. 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.
    8. Silvia Bonettini & Peter Ochs & Marco Prato & Simone Rebegoldi, 2023. "An abstract convergence framework with application to inertial inexact forward–backward methods," Computational Optimization and Applications, Springer, vol. 84(2), pages 319-362, March.
    9. Le Thi Khanh Hien & Duy Nhat Phan & Nicolas Gillis, 2022. "Inertial alternating direction method of multipliers for non-convex non-smooth optimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 247-285, September.
    10. Francesco Rinaldi & Damiano Zeffiro, 2023. "Avoiding bad steps in Frank-Wolfe variants," Computational Optimization and Applications, Springer, vol. 84(1), pages 225-264, January.
    11. Emilie Chouzenoux & Jean-Christophe Pesquet & Audrey Repetti, 2016. "A block coordinate variable metric forward–backward algorithm," Journal of Global Optimization, Springer, vol. 66(3), pages 457-485, November.
    12. Kely D. V. Villacorta & Paulo R. Oliveira & Antoine Soubeyran, 2014. "A Trust-Region Method for Unconstrained Multiobjective Problems with Applications in Satisficing Processes," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 865-889, March.
    13. Zhili Ge & Zhongming Wu & Xin Zhang & Qin Ni, 2023. "An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems," Journal of Global Optimization, Springer, vol. 86(4), pages 821-844, August.
    14. Bo Jiang & Tianyi Lin & Shiqian Ma & Shuzhong Zhang, 2019. "Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis," Computational Optimization and Applications, Springer, vol. 72(1), pages 115-157, January.
    15. Zehui Jia & Jieru Huang & Xingju Cai, 2021. "Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems," Journal of Global Optimization, Springer, vol. 80(4), pages 841-864, August.
    16. Dominikus Noll, 2014. "Convergence of Non-smooth Descent Methods Using the Kurdyka–Łojasiewicz Inequality," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 553-572, February.
    17. Glaydston C. Bento & Orizon P. Ferreira & Jefferson G. Melo, 2017. "Iteration-Complexity of Gradient, Subgradient and Proximal Point Methods on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 173(2), pages 548-562, May.
    18. Radu Ioan Bot & Dang-Khoa Nguyen, 2020. "The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 682-712, May.
    19. Peter Ochs, 2018. "Local Convergence of the Heavy-Ball Method and iPiano for Non-convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 153-180, April.
    20. Bolte, Jérôme & Le, Tam & Pauwels, Edouard & Silveti-Falls, Antonio, 2022. "Nonsmooth Implicit Differentiation for Machine Learning and Optimization," TSE Working Papers 22-1314, Toulouse School of Economics (TSE).

    More about this item

    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-01690176. 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: 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.