IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i5p675-d1345769.html
   My bibliography  Save this article

An Inertial Parametric Douglas–Rachford Splitting Method for Nonconvex Problems

Author

Listed:
  • Tianle Lu

    (School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan 030031, China)

  • Xue Zhang

    (School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan 030031, China)

Abstract

In this paper, we propose an inertial parametric Douglas–Rachford splitting method for minimizing the sum of two nonconvex functions, which has a wide range of applications. The proposed algorithm combines the inertial technique, the parametric technique, and the Douglas–Rachford method. Subsequently, in theoretical analysis, we construct a new merit function and establish the convergence of the sequence generated by the inertial parametric Douglas–Rachford splitting method. Finally, we present some numerical results on nonconvex feasibility problems to illustrate the efficiency of the proposed method.

Suggested Citation

  • Tianle Lu & Xue Zhang, 2024. "An Inertial Parametric Douglas–Rachford Splitting Method for Nonconvex Problems," Mathematics, MDPI, vol. 12(5), pages 1-24, February.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:5:p:675-:d:1345769
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/5/675/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/5/675/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Guoyin Li & Tianxiang Liu & Ting Kei Pong, 2017. "Peaceman–Rachford splitting for a class of nonconvex optimization problems," Computational Optimization and Applications, Springer, vol. 68(2), pages 407-436, November.
    2. Dongying Wang & Xianfu Wang, 2019. "A parameterized Douglas–Rachford algorithm," Computational Optimization and Applications, Springer, vol. 73(3), pages 839-869, July.
    3. Boţ, Radu Ioan & Csetnek, Ernö Robert & Hendrich, Christopher, 2015. "Inertial Douglas–Rachford splitting for monotone inclusion problems," Applied Mathematics and Computation, Elsevier, vol. 256(C), pages 472-487.
    4. Minh N. Dao, & Hung M. Phan, 2019. "Linear Convergence of Projection Algorithms," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 715-738, 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. Bian, Fengmiao & Zhang, Xiaoqun, 2021. "A parameterized Douglas–Rachford splitting algorithm for nonconvex optimization," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    2. Pawicha Phairatchatniyom & Poom Kumam & Yeol Je Cho & Wachirapong Jirakitpuwapat & Kanokwan Sitthithakerngkiet, 2019. "The Modified Inertial Iterative Algorithm for Solving Split Variational Inclusion Problem for Multi-Valued Quasi Nonexpansive Mappings with Some Applications," Mathematics, MDPI, vol. 7(6), pages 1-22, June.
    3. Chinedu Izuchukwu & Yekini Shehu, 2021. "New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems Beyond Monotonicity," Networks and Spatial Economics, Springer, vol. 21(2), pages 291-323, June.
    4. Q. L. Dong & J. Z. Huang & X. H. Li & Y. J. Cho & Th. M. Rassias, 2019. "MiKM: multi-step inertial Krasnosel’skiǐ–Mann algorithm and its applications," Journal of Global Optimization, Springer, vol. 73(4), pages 801-824, April.
    5. Dang Hieu & Pham Ky Anh & Nguyen Hai Ha, 2021. "Regularization Proximal Method for Monotone Variational Inclusions," Networks and Spatial Economics, Springer, vol. 21(4), pages 905-932, December.
    6. Seifu Endris Yimer & Poom Kumam & Anteneh Getachew Gebrie & Rabian Wangkeeree, 2019. "Inertial Method for Bilevel Variational Inequality Problems with Fixed Point and Minimizer Point Constraints," Mathematics, MDPI, vol. 7(9), pages 1-21, September.
    7. Xue Gao & Xingju Cai & Deren Han, 2020. "A Gauss–Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems," Journal of Global Optimization, Springer, vol. 76(4), pages 863-887, April.
    8. Bing Tan & Shanshan Xu & Songxiao Li, 2020. "Modified Inertial Hybrid and Shrinking Projection Algorithms for Solving Fixed Point Problems," Mathematics, MDPI, vol. 8(2), pages 1-12, February.
    9. Dongying Wang & Xianfu Wang, 2019. "A parameterized Douglas–Rachford algorithm," Computational Optimization and Applications, Springer, vol. 73(3), pages 839-869, July.
    10. Patrick R. Johnstone & Pierre Moulin, 2017. "Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions," Computational Optimization and Applications, Springer, vol. 67(2), pages 259-292, June.
    11. Lateef Olakunle Jolaoso & Maggie Aphane, 2020. "A Generalized Viscosity Inertial Projection and Contraction Method for Pseudomonotone Variational Inequality and Fixed Point Problems," Mathematics, MDPI, vol. 8(11), pages 1-29, November.
    12. Luis M. Briceño-Arias & Fernando Roldán, 2022. "Four-Operator Splitting via a Forward–Backward–Half-Forward Algorithm with Line Search," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 205-225, October.
    13. Li Wei & Yingzi Shang & Ravi P. Agarwal, 2019. "New Inertial Forward-Backward Mid-Point Methods for Sum of Infinitely Many Accretive Mappings, Variational Inequalities, and Applications," Mathematics, MDPI, vol. 7(5), pages 1-19, May.
    14. Chanjuan Pan & Yuanheng Wang, 2019. "Convergence Theorems for Modified Inertial Viscosity Splitting Methods in Banach Spaces," Mathematics, MDPI, vol. 7(2), pages 1-12, February.
    15. Hedy Attouch & Zaki Chbani & Jalal Fadili & Hassan Riahi, 2022. "Fast Convergence of Dynamical ADMM via Time Scaling of Damped Inertial Dynamics," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 704-736, June.
    16. Zhongming Wu & Min Li, 2019. "General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems," Computational Optimization and Applications, Springer, vol. 73(1), pages 129-158, May.
    17. E. M. Bednarczuk & A. Jezierska & K. E. Rutkowski, 2018. "Proximal primal–dual best approximation algorithm with memory," Computational Optimization and Applications, Springer, vol. 71(3), pages 767-794, December.
    18. Szilárd Csaba László, 2023. "A Forward–Backward Algorithm With Different Inertial Terms for Structured Non-Convex Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 387-427, July.
    19. Gang Cai & Qiao-Li Dong & Yu Peng, 2021. "Strong Convergence Theorems for Solving Variational Inequality Problems with Pseudo-monotone and Non-Lipschitz Operators," Journal of Optimization Theory and Applications, Springer, vol. 188(2), pages 447-472, February.
    20. Radu Ioan Boţ & Ernö Robert Csetnek, 2016. "An Inertial Tseng’s Type Proximal Algorithm for Nonsmooth and Nonconvex Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 600-616, November.

    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:gam:jmathe:v:12:y:2024:i:5:p:675-:d:1345769. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.