IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v206y2025i3d10.1007_s10957-025-02728-y.html
   My bibliography  Save this article

Characterizations, Dynamical Systems and Gradient Methods for Strongly Quasiconvex Functions

Author

Listed:
  • Felipe Lara

    (Universidad de Tarapacá)

  • Raúl T. Marcavillaca

    (Universidad de Chile)

  • Phan Tu Vuong

    (University of Southampton
    HCMC University of Technology and Education)

Abstract

We study differentiable strongly quasiconvex functions for providing new properties for algorithmic and monotonicity purposes. Furthermore, we provide insights into the decreasing behaviour of strongly quasiconvex functions, applying this for establishing exponential convergence for first- and second-order gradient systems without relying on the usual Lipschitz continuity assumption on the gradient of the function. The explicit discretization of the first-order dynamical system leads to the gradient descent method while discretization of the second-order dynamical system with viscous damping recovers the heavy ball method. We establish the linear convergence of both methods under suitable conditions on the parameters as well as numerical experiments for supporting our theoretical findings.

Suggested Citation

  • Felipe Lara & Raúl T. Marcavillaca & Phan Tu Vuong, 2025. "Characterizations, Dynamical Systems and Gradient Methods for Strongly Quasiconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 206(3), pages 1-25, September.
    • Handle: RePEc:spr:joptap:v:206:y:2025:i:3:d:10.1007_s10957-025-02728-y
    DOI: 10.1007/s10957-025-02728-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02728-y
    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/s10957-025-02728-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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Mohsen Rahimi Piranfar & Hadi Khatibzadeh, 2021. "Long-Time Behavior of a Gradient System Governed by a Quasiconvex Function," Journal of Optimization Theory and Applications, Springer, vol. 188(1), pages 169-191, January.
    2. F. Lara, 2022. "On Strongly Quasiconvex Functions: Existence Results and Proximal Point Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 891-911, March.
    3. Yurii Nesterov, 2018. "Lectures on Convex Optimization," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-91578-4, October.
    4. Ion Necoara & Yurii Nesterov & François Glineur, 2019. "Linear convergence of first order methods for non-strongly convex optimization," LIDAM Reprints CORE 3000, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. A. Kabgani & F. Lara, 2022. "Strong subdifferentials: theory and applications in nonconvex optimization," Journal of Global Optimization, Springer, vol. 84(2), pages 349-368, October.
    6. J. Bolte, 2003. "Continuous Gradient Projection Method in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 119(2), pages 235-259, November.
    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. Sorin-Mihai Grad & Felipe Lara & Raúl T. Marcavillaca, 2025. "Strongly Quasiconvex Functions: What We Know (So Far)," Journal of Optimization Theory and Applications, Springer, vol. 205(2), pages 1-41, May.
    2. Balendu Bhooshan Upadhyay & Subham Poddar & Jen-Chih Yao & Xiaopeng Zhao, 2025. "Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials," Annals of Operations Research, Springer, vol. 345(1), pages 417-466, February.
    3. Alfredo Iusem & Felipe Lara & Raúl T. Marcavillaca & Le Hai Yen, 2024. "A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming," Journal of Global Optimization, Springer, vol. 90(3), pages 755-779, November.
    4. Shota Takahashi & Mituhiro Fukuda & Mirai Tanaka, 2022. "New Bregman proximal type algorithms for solving DC optimization problems," Computational Optimization and Applications, Springer, vol. 83(3), pages 893-931, December.
    5. Fu, Hao & Lam, William H.K. & Ma, Wei & Shi, Yuxin & Jiang, Rui & Sun, Huijun & Gao, Ziyou, 2025. "Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    6. Xin Jiang & Lieven Vandenberghe, 2022. "Bregman primal–dual first-order method and application to sparse semidefinite programming," Computational Optimization and Applications, Springer, vol. 81(1), pages 127-159, January.
    7. Huiyi Cao & Kamil A. Khan, 2023. "General convex relaxations of implicit functions and inverse functions," Journal of Global Optimization, Springer, vol. 86(3), pages 545-572, July.
    8. Xin Yang & Lingling Xu, 2023. "Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems," Journal of Global Optimization, Springer, vol. 87(2), pages 939-964, November.
    9. Sorin-Mihai Grad & Felipe Lara & Raúl Tintaya Marcavillaca, 2024. "Relaxed-Inertial Proximal Point Algorithms for Nonconvex Equilibrium Problems with Applications," Journal of Optimization Theory and Applications, Springer, vol. 203(3), pages 2233-2262, December.
    10. Egor Gladin & Alexander Gasnikov & Pavel Dvurechensky, 2025. "Accuracy Certificates for Convex Minimization with Inexact Oracle," Journal of Optimization Theory and Applications, Springer, vol. 204(1), pages 1-23, January.
    11. Pavel Shcherbakov & Mingyue Ding & Ming Yuchi, 2021. "Random Sampling Many-Dimensional Sets Arising in Control," Mathematics, MDPI, vol. 9(5), pages 1-16, March.
    12. Shariat Torbaghan, Shahab & Madani, Mehdi & Sels, Peter & Virag, Ana & Le Cadre, Hélène & Kessels, Kris & Mou, Yuting, 2021. "Designing day-ahead multi-carrier markets for flexibility: Models and clearing algorithms," Applied Energy, Elsevier, vol. 285(C).
    13. Ching-pei Lee & Stephen J. Wright, 2019. "Inexact Successive quadratic approximation for regularized optimization," Computational Optimization and Applications, Springer, vol. 72(3), pages 641-674, April.
    14. Behzad Azmi & Marco Bernreuther, 2025. "On the forward–backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems," Computational Optimization and Applications, Springer, vol. 91(3), pages 1263-1308, July.
    15. Jean-Jacques Forneron, 2023. "Noisy, Non-Smooth, Non-Convex Estimation of Moment Condition Models," Papers 2301.07196, arXiv.org, revised Aug 2025.
    16. Azimbek Khudoyberdiev & Shabir Ahmad & Israr Ullah & DoHyeun Kim, 2020. "An Optimization Scheme Based on Fuzzy Logic Control for Efficient Energy Consumption in Hydroponics Environment," Energies, MDPI, vol. 13(2), pages 1-27, January.
    17. David Müller & Vladimir Shikhman, 2022. "Network manipulation algorithm based on inexact alternating minimization," Computational Management Science, Springer, vol. 19(4), pages 627-664, October.
    18. Mehdi Karimi & Levent Tunçel, 2020. "Primal–Dual Interior-Point Methods for Domain-Driven Formulations," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 591-621, May.
    19. Fosgerau, Mogens & Melo, Emerson & Shum, Matthew & Sørensen, Jesper R.-V., 2021. "Some remarks on CCP-based estimators of dynamic models," Economics Letters, Elsevier, vol. 204(C).
    20. A. Kabgani & F. Lara, 2022. "Strong subdifferentials: theory and applications in nonconvex optimization," Journal of Global Optimization, Springer, vol. 84(2), pages 349-368, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:spr:joptap:v:206:y:2025:i:3:d:10.1007_s10957-025-02728-y. 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.