{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T08:07:12Z","timestamp":1761898032763,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100025282","name":"Science, Mathematics, And Research For Transformation Scholarship Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100025282","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]},{"name":"PHC FASIC program","award":["49763ZL"],"award-info":[{"award-number":["49763ZL"]}]},{"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":"Royal Melbourne Institute of Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we develop a splitting algorithm incorporating Bregman distances to solve a broad class of linearly constrained composite optimization problems, whose objective function is the separable sum of possibly nonconvex nonsmooth functions and a smooth function, coupled by a difference of functions. This structure encapsulates numerous significant nonconvex and nonsmooth optimization problems in the current literature including the linearly constrained difference-of-convex problems. Relying on the successive linearization and alternating direction method of multipliers (ADMM), the proposed algorithm exhibits the global subsequential convergence to a stationary point of the underlying problem. We also establish the convergence of the full sequence generated by our algorithm under the Kurdyka\u2013\u0141ojasiewicz property and some mild assumptions. The efficiency of the proposed algorithm is tested on a robust principal component analysis problem and a nonconvex optimal power flow problem.\n<\/jats:p>","DOI":"10.1007\/s10957-024-02539-7","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T06:02:27Z","timestamp":1727676147000},"page":"1622-1658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions"],"prefix":"10.1007","volume":"203","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0445-745X","authenticated-orcid":false,"given":"Tan Nhat","family":"Pham","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8074-6675","authenticated-orcid":false,"given":"Minh N.","family":"Dao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2977-3456","authenticated-orcid":false,"given":"Andrew","family":"Eberhard","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2373-0834","authenticated-orcid":false,"given":"Nargiz","family":"Sultanova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,30]]},"reference":[{"key":"2539_CR1","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.rser.2016.12.102","volume":"71","author":"H Abdi","year":"2017","unstructured":"Abdi, H., Beigvand, S.D., Scala, M.L.: A review of optimal power flow studies applied to smart grids and microgrids. Renew. Sustain. Energy Rev. 71, 742\u2013766 (2017)","journal-title":"Renew. Sustain. Energy Rev."},{"issue":"21","key":"2539_CR2","doi-asserted-by":"publisher","first-page":"5811","DOI":"10.1049\/iet-gtd.2018.6036","volume":"12","author":"MP Abraham","year":"2018","unstructured":"Abraham, M.P., Kulkarni, A.A.: ADMM-based algorithm for solving DC-OPF in a large electricity network considering transmission losses. IET Gener. Transm. Distrib. 12(21), 5811\u20135823 (2018)","journal-title":"IET Gener. Transm. Distrib."},{"issue":"1","key":"2539_CR3","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":"2539_CR4","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. Math. Program. 116(1\u20132), 5\u201316 (2007)","journal-title":"Math. Program."},{"issue":"3","key":"2539_CR5","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. Math. Oper. Res. 47(3), 2415\u20132443 (2022)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2539_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/22M1472000","volume":"33","author":"RI Bo\u0163","year":"2023","unstructured":"Bo\u0163, R.I., Dao, M.N., Li, G.: Inertial proximal block coordinate method for a class of nonsmooth sum-of-ratios optimization problems. SIAM J. Optim. 33(2), 361\u2013393 (2023)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2539_CR7","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"4","key":"2539_CR8","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2539_CR9","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/060649021","volume":"29","author":"IS Dhillon","year":"2008","unstructured":"Dhillon, I.S., Tropp, J.A.: Matrix nearness problems with Bregman divergences. SIAM J. Matrix Anal. Appl. 29(4), 1120\u20131146 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"12","key":"2539_CR10","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Trans. Signal Process. 57(12), 4686\u20134698 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"2539_CR11","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1080\/00207160.2016.1227432","volume":"94","author":"K Guo","year":"2016","unstructured":"Guo, K., Han, D.R., Wu, T.T.: Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints. Int. J. Comput. Math. 94(8), 1653\u20131669 (2016)","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"2539_CR12","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Ann. de l\u2019institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Ann. de l\u2019institut Fourier"},{"issue":"4","key":"2539_CR13","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25(4), 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"2539_CR14","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1002\/nla.1981","volume":"22","author":"X Li","year":"2015","unstructured":"Li, X., Ng, M.K., Yuan, X.: Median filtering-based methods for static background extraction from surveillance video. Numer. Linear Algebra Appl. 22(5), 845\u2013865 (2015)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"2539_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10915-017-0612-7","volume":"76","author":"T Lin","year":"2017","unstructured":"Lin, T., Ma, S., Zhang, S.: Global convergence of unmodified 3-block ADMM for a class of convex minimization problems. J. Sci. Comput. 76(1), 69\u201388 (2017)","journal-title":"J. Sci. Comput."},{"key":"2539_CR16","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00c9quations aux D\u00e9riv\u00e9es Partielles, pp. 87\u201389 (1963)"},{"issue":"2","key":"2539_CR17","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. J. Sci. Comput. 74(2), 767\u2013785 (2017)","journal-title":"J. Sci. Comput."},{"key":"2539_CR18","series-title":"Grundlehren der mathematischen Wissenschaften","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. Grundlehren der mathematischen Wissenschaften, vol. 330. Springer, Berlin (2006)"},{"key":"2539_CR19","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Convex Optimization. Springer Optimization and Its Applications, vol. 137. Springer International Publishing, Cham (2018)"},{"issue":"2","key":"2539_CR20","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/040605412","volume":"4","author":"S Osher","year":"2005","unstructured":"Osher, S., Burger, M., Goldfarb, D., Xu, J., Yin, W.: An iterative regularization method for total variation-based image restoration. Multisc. Model. Simul. 4(2), 460\u2013489 (2005)","journal-title":"Multisc. Model. Simul."},{"issue":"4","key":"2539_CR21","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. Numer. Algor. 94(4), 1763\u20131795 (2023)","journal-title":"Numer. Algor."},{"key":"2539_CR22","series-title":"Grundlehren der mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T.: Variational Analysis. Grundlehren der mathematischen Wissenschaften, vol. 317. Springer, Berlin (1998)"},{"issue":"3","key":"2539_CR23","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s10444-017-9559-3","volume":"44","author":"T Sun","year":"2017","unstructured":"Sun, T., Yin, P., Cheng, L., Jiang, H.: Alternating direction method of multipliers with difference of convex functions. Adv. Comput. Math. 44(3), 723\u2013744 (2017)","journal-title":"Adv. Comput. Math."},{"issue":"4","key":"2539_CR24","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10898-019-00828-4","volume":"76","author":"K Tu","year":"2019","unstructured":"Tu, K., Zhang, H., Gao, H., Feng, J.: A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems. J. Global Optim. 76(4), 665\u2013693 (2019)","journal-title":"J. Global Optim."},{"key":"2539_CR25","unstructured":"Wang, H., Banerjee, A.: Bregman alternating direction method of multipliers. In Proceedings of the 27th International Conference on Neural Information Processing Systems-Vol 2, NIPS\u201914, pp. 2816-2824, Cambridge, MA, USA. MIT Press (2014)"},{"issue":"8","key":"2539_CR26","doi-asserted-by":"publisher","first-page":"2555","DOI":"10.1080\/02331934.2023.2230994","volume":"73","author":"X Wang","year":"2023","unstructured":"Wang, X., Shao, H., Liu, P., Yang, W.: An inertial proximal splitting method with applications. Optimization 73(8), 2555\u20132584 (2023)","journal-title":"Optimization"},{"issue":"1","key":"2539_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78(1), 29\u201363 (2018)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2539_CR28","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1137\/15M1027528","volume":"10","author":"L Yang","year":"2017","unstructured":"Yang, L., Pong, T.K., Chen, X.: Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background\/foreground extraction. SIAM J. Imag. Sci. 10(1), 74\u2013110 (2017)","journal-title":"SIAM J. Imag. Sci."},{"key":"2539_CR29","unstructured":"Yang, Y., Guan, X., Jia, Q.-S., Yu, L., Xu, B., Spanos, C.J.: A survey of ADMM variants for distributed optimization: Problems, algorithms and features (2022). arXiv:2208.03700"},{"issue":"3","key":"2539_CR30","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1007\/s10957-021-01919-7","volume":"190","author":"M Yashtini","year":"2021","unstructured":"Yashtini, M.: Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-\u0141ojasiewicz property. J. Optim. Theory Appl. 190(3), 966\u2013998 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2539_CR31","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"2539_CR32","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TPWRS.2010.2051168","volume":"26","author":"RD Zimmerman","year":"2011","unstructured":"Zimmerman, R.D., Murillo-Sanchez, C.E., Thomas, R.J.: MATPOWER: steady-state operations, planning, and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26(1), 12\u201319 (2011)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02539-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02539-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02539-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T10:09:52Z","timestamp":1731319792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02539-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2539"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02539-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2024,9,30]]},"assertion":[{"value":"8 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}