IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v203y2024i1d10.1007_s10957-024-02536-w.html
   My bibliography  Save this article

Finite-Time Nonconvex Optimization Using Time-Varying Dynamical Systems

Author

Listed:
  • Lien T. Nguyen

    (RMIT University)

  • Andrew Eberhard

    (RMIT University)

  • Xinghuo Yu

    (RMIT University)

  • Alexander Y. Kruger

    (Ton Duc Thang University)

  • Chaojie Li

    (University of New South Wales)

Abstract

In this paper, we study the finite-time convergence of the time-varying dynamical systems for solving convex and nonconvex optimization problems in different scenarios. We first show the asymptotic convergence of the trajectories of dynamical systems while only requiring convexity of the objective function. Under the Kurdyka–Łojasiewicz (KL) exponent of the objective function, we establish the finite-time convergence of the trajectories to the optima from any initial point. Making use of the Moreau envelope, we adapt our finite-time convergent algorithm to solve weakly convex nonsmooth optimization problems. In addition, we unify and extend the contemporary results on the KL exponent of the Moreau envelope of weakly convex functions. A dynamical system is also introduced to find a fixed point of a nonexpansive operator in finite time and fixed time under additional regularity properties. We then apply it to address the composite optimization problems with finite-time and fixed-time convergence.

Suggested Citation

  • Lien T. Nguyen & Andrew Eberhard & Xinghuo Yu & Alexander Y. Kruger & Chaojie Li, 2024. "Finite-Time Nonconvex Optimization Using Time-Varying Dynamical Systems," Journal of Optimization Theory and Applications, Springer, vol. 203(1), pages 844-879, October.
    • Handle: RePEc:spr:joptap:v:203:y:2024:i:1:d:10.1007_s10957-024-02536-w
    DOI: 10.1007/s10957-024-02536-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02536-w
    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-024-02536-w?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. Sedi Bartz & Minh N. Dao & Hung M. Phan, 2022. "Conical averagedness and convergence analysis of fixed point algorithms," Journal of Global Optimization, Springer, vol. 82(2), pages 351-373, February.
    2. Yurii Nesterov, 2018. "Lectures on Convex Optimization," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-91578-4, December.
    3. B. Abbas & H. Attouch & Benar F. Svaiter, 2014. "Newton-Like Dynamics and Forward-Backward Methods for Structured Monotone Inclusions in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 331-360, May.
    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. 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.
    2. 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.
    3. Sedi Bartz & Rubén Campoy & Hung M. Phan, 2022. "An Adaptive Alternating Direction Method of Multipliers," Journal of Optimization Theory and Applications, Springer, vol. 195(3), pages 1019-1055, December.
    4. 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.
    5. Pavel Shcherbakov & Mingyue Ding & Ming Yuchi, 2021. "Random Sampling Many-Dimensional Sets Arising in Control," Mathematics, MDPI, vol. 9(5), pages 1-16, March.
    6. Boţ, R.I. & Csetnek, E.R. & Vuong, P.T., 2020. "The forward–backward–forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces," European Journal of Operational Research, Elsevier, vol. 287(1), pages 49-60.
    7. 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).
    8. Jean-Jacques Forneron, 2023. "Noisy, Non-Smooth, Non-Convex Estimation of Moment Condition Models," Papers 2301.07196, arXiv.org, revised Feb 2023.
    9. 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.
    10. 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.
    11. 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.
    12. 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).
    13. Ramon de Punder & Timo Dimitriadis & Rutger-Jan Lange, 2024. "Kullback-Leibler-based characterizations of score-driven updates," Papers 2408.02391, arXiv.org, revised Sep 2024.
    14. Pham Duy Khanh & Boris S. Mordukhovich & Vo Thanh Phat & Dat Ba Tran, 2023. "Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials," Journal of Global Optimization, Springer, vol. 86(1), pages 93-122, May.
    15. Yurii Nesterov, 2024. "Primal Subgradient Methods with Predefined Step Sizes," Journal of Optimization Theory and Applications, Springer, vol. 203(3), pages 2083-2115, December.
    16. Samir Adly & Hedy Attouch & Van Nam Vo, 2023. "Convergence of Inertial Dynamics Driven by Sums of Potential and Nonpotential Operators with Implicit Newton-Like Damping," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 290-331, July.
    17. Boţ, Radu Ioan & Kanzler, Laura, 2021. "A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function," Applied Mathematics and Computation, Elsevier, vol. 394(C).
    18. Yurii Nesterov, 2021. "Superfast Second-Order Methods for Unconstrained Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 1-30, October.
    19. Pankaj Gautam & Daya Ram Sahu & Avinash Dixit & Tanmoy Som, 2021. "Forward–Backward–Half Forward Dynamical Systems for Monotone Inclusion Problems with Application to v-GNE," Journal of Optimization Theory and Applications, Springer, vol. 190(2), pages 491-523, August.
    20. Roland Hildebrand, 2021. "Optimal step length for the Newton method: case of self-concordant functions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(2), pages 253-279, October.

    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:203:y:2024:i:1:d:10.1007_s10957-024-02536-w. 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.