IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v394y2021ics009630032030775x.html
   My bibliography  Save this article

A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function

Author

Listed:
  • Boţ, Radu Ioan
  • Kanzler, Laura

Abstract

In this paper we aim to minimize the sum of two nonsmooth (possibly also nonconvex) functions in separate variables connected by a smooth coupling function. To tackle this problem we choose a continuous forward-backward approach and introduce a dynamical system which is formulated by means of the partial gradients of the smooth coupling function and the proximal point operator of the two nonsmooth functions. Moreover, we consider variable rates of implicity of the resulting system. We discuss the existence and uniqueness of a solution and carry out the asymptotic analysis of its convergence behaviour to a critical point of the optimization problem, when a regularization of the objective function fulfills the Kurdyka-Łojasiewicz property. We further provide convergence rates for the solution trajectory in terms of the Łojasiewicz exponent. We conclude this work with numerical simulations which confirm and validate the analytical results.

Suggested Citation

  • 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).
  • Handle: RePEc:eee:apmaco:v:394:y:2021:i:c:s009630032030775x
    DOI: 10.1016/j.amc.2020.125822
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032030775X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2020.125822?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. Radu Ioan Boţ & Ernö Robert Csetnek & Szilárd Csaba László, 2016. "An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(1), pages 3-25, February.
    2. 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.
    3. 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. 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.
    2. 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.
    3. Haixin Ren & Bin Ge & Xiangwu Zhuge, 2023. "Fast Convergence of Inertial Gradient Dynamics with Multiscale Aspects," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 461-489, February.
    4. 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.
    5. 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.
    6. Yingting Zhang & Zewei Huang, 2022. "Application of multimedia network english listening model based on confidence learning algorithm for speech recognition," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(3), pages 1091-1101, December.
    7. Xianfu Wang & Ziyuan Wang, 2022. "Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems," Computational Optimization and Applications, Springer, vol. 82(2), pages 441-463, June.
    8. Dang Hieu, 2018. "An inertial-like proximal algorithm for equilibrium problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 88(3), pages 399-415, December.
    9. Zhongming Wu & Min Li & David Z. W. Wang & Deren Han, 2017. "A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(06), pages 1-27, December.
    10. 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.
    11. Rieger, Janosch & Tam, Matthew K., 2020. "Backward-Forward-Reflected-Backward Splitting for Three Operator Monotone Inclusions," Applied Mathematics and Computation, Elsevier, vol. 381(C).
    12. 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.
    13. Samir Adly & Hedy Attouch & Manh Hung Le, 2024. "A Doubly Nonlinear Evolution System with Threshold Effects Associated with Dry Friction," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1188-1218, November.
    14. Sylvain Sorin, 2023. "Continuous Time Learning Algorithms in Optimization and Game Theory," Dynamic Games and Applications, Springer, vol. 13(1), pages 3-24, March.
    15. Wenjie Wang & Chunyan Wang & Mengzhen Li, 2024. "A Second-Order Continuous-Time Dynamical System for Solving Sparse Image Restoration Problems," Mathematics, MDPI, vol. 12(15), pages 1-15, July.
    16. Christian Kanzow & Patrick Mehlitz, 2022. "Convergence Properties of Monotone and Nonmonotone Proximal Gradient Methods Revisited," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 624-646, November.
    17. P. Nistri & M. Quincampoix, 2005. "On the Dynamics of a Differential Inclusion Built upon a Nonconvex Constrained Minimization Problem," Journal of Optimization Theory and Applications, Springer, vol. 124(3), pages 659-672, March.
    18. Pham Viet Hai & Phan Tu Vuong, 2024. "Third Order Dynamical Systems for the Sum of Two Generalized Monotone Operators," Journal of Optimization Theory and Applications, Springer, vol. 202(2), pages 519-553, August.
    19. Zhongming Wu & Chongshou Li & Min Li & Andrew Lim, 2021. "Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems," Journal of Global Optimization, Springer, vol. 79(3), pages 617-644, March.

    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:eee:apmaco:v:394:y:2021:i:c:s009630032030775x. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.