{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:09:58Z","timestamp":1771326598809,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:00:00Z","timestamp":1748908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:00:00Z","timestamp":1748908800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP230101749"],"award-info":[{"award-number":["DP230101749"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007493","name":"Fondation Math\u00e9matique Jacques Hadamard","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007493","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Henry Sutton PhD Scholarship Program"},{"name":"Royal Melbourne Institute of Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper, we consider a class of structured nonconvex nonsmooth optimization problems whose objective function is the sum of three nonconvex functions, one of which is expressed in a difference-of-convex (DC) form. This problem class covers several important structures in the literature including the sum of three functions and the general DC program. We propose a splitting algorithm and prove the subsequential convergence to a stationary point of the problem. The full sequential convergence, along with convergence rates for both the iterates and objective function values, is then established without requiring differentiability of the concave part. Our analysis not only extends but also unifies and improves recent convergence analyses in nonconvex settings. We benchmark our proposed algorithm with notable algorithms in the literature to show its competitiveness on a low rank matrix completion problem and a simultaneously sparse and low-rank matrix estimation problem. Our algorithm exhibits very competitive results compared to notable algorithms in the literature, on both synthetic data and public dataset.<\/jats:p>","DOI":"10.1007\/s10915-025-02950-w","type":"journal-article","created":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T03:05:26Z","timestamp":1748919926000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Doubly relaxed forward-Douglas\u2013Rachford splitting for the sum of two nonconvex and a DC function"],"prefix":"10.1007","volume":"104","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8074-6675","authenticated-orcid":false,"given":"Minh N.","family":"Dao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0445-745X","authenticated-orcid":false,"given":"Tan Nhat","family":"Pham","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3592-1245","authenticated-orcid":false,"given":"Phan Thanh","family":"Tung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,3]]},"reference":[{"issue":"1","key":"2950_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/02331934.2016.1253694","volume":"66","author":"NT An","year":"2016","unstructured":"An, N.T., Nam, N.M.: Convergence analysis of a proximal point algorithm for minimizing differences of functions. Optimization 66(1), 129\u2013147 (2016)","journal-title":"Optimization"},{"issue":"1\u20132","key":"2950_CR2","first-page":"5","volume":"116","author":"H Attouch","year":"2007","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Mathematical Programming 116(1\u20132), 5\u201316 (2007)","journal-title":"Mathematical Programming"},{"issue":"1","key":"2950_CR3","first-page":"2232","volume":"19","author":"A Barbero","year":"2018","unstructured":"Barbero, A., Sra, S.: Modular proximal optimization for multidimensional total-variation regularization. Journal of Machine Learning Research 19(1), 2232\u20132313 (2018)","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"2950_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10898-021-01057-4","volume":"82","author":"S Bartz","year":"2022","unstructured":"Bartz, S., Dao, M.N., Phan, H.M.: Conical averagedness and convergence analysis of fixed point algorithms. Journal of Global Optimization 82(2), 351\u2013373 (2022)","journal-title":"Journal of Global Optimization"},{"key":"2950_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"H Bauschke","year":"2017","unstructured":"Bauschke, H., Combettes, P.: Convex analysis and monotone operator theory in Hilbert spaces, 2nd edn. CMS Books in Mathematics. Springer, Cham (2017)","edition":"2"},{"issue":"4","key":"2950_CR6","doi-asserted-by":"publisher","first-page":"A2809","DOI":"10.1137\/20M1326775","volume":"43","author":"F Bian","year":"2021","unstructured":"Bian, F., Zhang, X.: A three-operator splitting algorithm for nonconvex sparsity regularization. SIAM Journal on Scientific Computing 43(4), A2809\u2013A2839 (2021)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"3","key":"2950_CR7","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1287\/moor.2021.1214","volume":"47","author":"RI Bo\u0163","year":"2022","unstructured":"Bo\u0163, R.I., Dao, M.N., Li, G.: Extrapolated proximal subgradient algorithms for nonconvex and nonsmooth fractional programs. Mathematics of Operations Research 47(3), 2415\u20132443 (2022)","journal-title":"Mathematics of Operations Research"},{"issue":"5","key":"2950_CR8","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1080\/02331934.2013.855210","volume":"64","author":"LM Brice\u00f1o-Arias","year":"2013","unstructured":"Brice\u00f1o-Arias, L.M.: Forward-Douglas-Rachford splitting and forward-partial inverse method for solving monotone inclusions. Optimization 64(5), 1239\u20131261 (2013)","journal-title":"Optimization"},{"issue":"4","key":"2950_CR9","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization 20(4), 1956\u20131982 (2010)","journal-title":"SIAM Journal on Optimization"},{"key":"2950_CR10","doi-asserted-by":"crossref","unstructured":"Cai, L., Gu, J., Jin, Z.: Low rank matrix completion for recovering missing load data in power system. In: 2018 IEEE Power & Energy Society General Meeting (PESGM), pp. 1\u20135. Portland, OR, USA (2018)","DOI":"10.1109\/PESGM.2018.8585746"},{"issue":"4","key":"2950_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numerica 25(4), 161\u2013319 (2016)","journal-title":"Acta Numerica"},{"issue":"2","key":"2950_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10898-021-01079-y","volume":"82","author":"CS Chuang","year":"2021","unstructured":"Chuang, C.S., He, H., Zhang, Z.: A unified Douglas-Rachford algorithm for generalized DC programming. Journal of Global Optimization 82(2), 331\u2013349 (2021)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"2950_CR13","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1137\/18M121160X","volume":"29","author":"MN Dao","year":"2019","unstructured":"Dao, M.N., Phan, H.M.: Adaptive Douglas-Rachford splitting algorithm for the sum of two operators. SIAM Journal on Optimization 29(4), 2697\u20132724 (2019)","journal-title":"SIAM Journal on Optimization"},{"key":"2950_CR14","doi-asserted-by":"crossref","unstructured":"Dao, M.N., Phan, H.M.: An adaptive splitting algorithm for the sum of two generalized monotone operators and one cocoercive operator. Fixed Point Theory and Algorithms for Sciences and Engineering 2021(1) (2021)","DOI":"10.1186\/s13663-021-00701-8"},{"issue":"4","key":"2950_CR15","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Valued and Variational Analysis 25(4), 829\u2013858 (2017)","journal-title":"Set-Valued and Variational Analysis"},{"issue":"2","key":"2950_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Transactions of the American Mathematical Society 82(2), 421\u2013439 (1956)","journal-title":"Transactions of the American Mathematical Society"},{"key":"2950_CR17","unstructured":"El\u00a0Halabi, M., Cevher, V.: A totally unimodular view of structured sparsity. In: Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol.\u00a038, pp. 223\u2013231. San Diego, California, USA (2015)"},{"key":"2950_CR18","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.P.: Group lasso with overlap and graph lasso. In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML \u201909. ACM (2009)","DOI":"10.1145\/1553374.1553431"},{"key":"2950_CR19","unstructured":"Jain, P., Meka, R., Dhillon, I.: Guaranteed rank minimization via singular value projection. In: Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 1, NIPS\u201910, pp. 937\u2013945. Curran Associates Inc., Red Hook, NY, USA (2010)"},{"issue":"1","key":"2950_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Mathematical Programming 169(1), 5\u201368 (2018)","journal-title":"Mathematical Programming"},{"issue":"2","key":"2950_CR21","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10589-017-9915-8","volume":"68","author":"G Li","year":"2017","unstructured":"Li, G., Liu, T., Pong, T.K.: Peaceman-Rachford splitting for a class of nonconvex optimization problems. Computational Optimization and Applications 68(2), 407\u2013436 (2017)","journal-title":"Computational Optimization and Applications"},{"issue":"1\u20132","key":"2950_CR22","first-page":"371","volume":"159","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Mathematical Programming 159(1\u20132), 371\u2013401 (2015)","journal-title":"Mathematical Programming"},{"issue":"1","key":"2950_CR23","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-019-00067-z","volume":"73","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A refined convergence analysis of pDCAe with applications to simultaneous sparse recovery and outlier detection. Computational Optimization and Applications 73(1), 69\u2013100 (2019)","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"2950_CR24","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2017","unstructured":"Lou, Y., Yan, M.: Fast L1\u2013L2 minimization via a proximal operator. Journal of Scientific Computing 74(2), 767\u2013785 (2017)","journal-title":"Journal of Scientific Computing"},{"key":"2950_CR25","doi-asserted-by":"crossref","unstructured":"Meka, R., Jain, P., Caramanis, C., Dhillon, I.S.: Rank minimization via online learning. In: Proceedings of the 25th international conference on Machine learning - ICML \u201908, ICML \u201908, pp. 656\u2013663. ACM Press, New York, NY, USA (2008)","DOI":"10.1145\/1390156.1390239"},{"key":"2950_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation I","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I. Basic Theory. Springer, Berlin Heidelberg (2006)"},{"issue":"2","key":"2950_CR27","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0022-247X(79)90234-8","volume":"72","author":"GB Passty","year":"1979","unstructured":"Passty, G.B.: Ergodic convergence to a zero of the sum of monotone operators in hilbert space. Journal of Mathematical Analysis and Applications 72(2), 383\u2013390 (1979)","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"1","key":"2950_CR28","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0103003","volume":"3","author":"D Peaceman","year":"1955","unstructured":"Peaceman, D., Rachford, H.H.: The numerical solution of parabolic and elliptic differential equations. Journal of the Society for Industrial and Applied Mathematics 3(1), 28\u201341 (1955)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"4","key":"2950_CR29","doi-asserted-by":"publisher","first-page":"1763","DOI":"10.1007\/s11075-023-01554-5","volume":"94","author":"TN Pham","year":"2023","unstructured":"Pham, T.N., Dao, M.N., Shah, R., Sultanova, N., Li, G., Islam, S.: A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems. Numerical Algorithms 94(4), 1763\u20131795 (2023)","journal-title":"Numerical Algorithms"},{"key":"2950_CR30","unstructured":"Richard, E., Savalle, P.A., Vayatis, N.: Estimation of simultaneously sparse and low rank matrices. In: Proceedings of the 29th International Conference on Machine Learning, p. 51-58. Madison, WI, USA (2012)"},{"key":"2950_CR31","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., J-B. Wets, R.: Variational Analysis, Grundlehren der mathematischen Wissenschaften, vol. 317. Springer Berlin Heidelberg, Berlin, Heidelberg (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"2950_CR32","doi-asserted-by":"crossref","unstructured":"Shi, Y., Yang, K., Yang, Z., Zhou, Y.: Coded computing for on-device cooperative inference. In: Mobile Edge Artificial Intelligence, chap.\u00a06, p. 83-101. Elsevier (2022)","DOI":"10.1016\/B978-0-12-823817-2.00016-4"},{"key":"2950_CR33","doi-asserted-by":"crossref","unstructured":"Wang, M., Chow, J.H., Gao, P., Jiang, X.T., Xia, Y., Ghiocel, S.G., Fardanesh, B., Stefopolous, G., Kokai, Y., Saito, N., Razanousky, M.: A low-rank matrix approach for the analysis of large amounts of power system synchrophasor data. In: 2015 48th Hawaii International Conference on System Sciences. IEEE (2015)","DOI":"10.1109\/HICSS.2015.318"},{"issue":"2","key":"2950_CR34","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Computational Optimization and Applications 69(2), 297\u2013324 (2017)","journal-title":"Computational Optimization and Applications"},{"issue":"6","key":"2950_CR35","first-page":"1751","volume":"8","author":"C Zhuang","year":"2022","unstructured":"Zhuang, C., An, J., Liu, Z., Zeng, R.: Data completion for power load analysis considering the low-rank property. CSEE Journal of Power and Energy Systems 8(6), 1751\u20131759 (2022)","journal-title":"CSEE Journal of Power and Energy Systems"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02950-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02950-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02950-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T17:20:42Z","timestamp":1757179242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02950-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,3]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2950"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02950-w","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,3]]},"assertion":[{"value":"16 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"35"}}