{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T21:36:43Z","timestamp":1782423403125,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T00:00:00Z","timestamp":1663891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T00:00:00Z","timestamp":1663891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18K11178"],"award-info":[{"award-number":["JP18K11178"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP19K15247"],"award-info":[{"award-number":["JP19K15247"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2018\/24293-0"],"award-info":[{"award-number":["2018\/24293-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2020\/04585-7"],"award-info":[{"award-number":["2020\/04585-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Difference of Convex (DC) optimization problems have objective functions that are differences between two convex functions. Representative ways of solving these problems are the proximal DC algorithms, which require that the convex part of the objective function have <jats:italic>L<\/jats:italic>-smoothness. In this article, we propose the Bregman Proximal DC Algorithm (BPDCA) for solving large-scale DC optimization problems that do not possess <jats:italic>L<\/jats:italic>-smoothness. Instead, it requires that the convex part of the objective function has the <jats:italic>L<\/jats:italic>-smooth adaptable property that is exploited in Bregman proximal gradient algorithms. In addition, we propose an accelerated version, the Bregman Proximal DC Algorithm with extrapolation (BPDCAe), with a new restart scheme. We show the global convergence of the iterates generated by BPDCA(e) to a limiting critical point under the assumption of the Kurdyka-\u0141ojasiewicz property or subanalyticity of the objective function and other weaker conditions than those of the existing methods. We applied our algorithms to phase retrieval, which can be described both as a nonconvex optimization problem and as a DC optimization problem. Numerical experiments showed that BPDCAe outperformed existing Bregman proximal-type algorithms because the DC formulation allows for larger admissible step sizes.<\/jats:p>","DOI":"10.1007\/s10589-022-00411-w","type":"journal-article","created":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T20:19:28Z","timestamp":1663964368000},"page":"893-931","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["New Bregman proximal type algorithms for solving DC optimization problems\ufeff"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3405-7163","authenticated-orcid":false,"given":"Shota","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2280-6190","authenticated-orcid":false,"given":"Mituhiro","family":"Fukuda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3588-5585","authenticated-orcid":false,"given":"Mirai","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"issue":"1","key":"411_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"411_CR2","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Op. Res. 42(2), 330\u2013348 (2017)","journal-title":"Math. Op. Res."},{"key":"411_CR3","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization, Volume 25 of MOS-SIAM Series on Optimization. SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"issue":"1","key":"411_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"411_CR5","doi-asserted-by":"crossref","unstructured":"Bierstone, E., Milman, P.D.: Semialgebraic and subanalytic sets. Publications math\u00e9matiques de l\u2019I.H.\u00c9.S., 67:5\u201342, (1988)","DOI":"10.1007\/BF02699126"},{"issue":"4","key":"411_CR6","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical system. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"411_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"411_CR8","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1137\/17M1138558","volume":"28","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M., Vaisbourd, Y.: First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28(3), 2131\u20132151 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"411_CR9","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":"411_CR10","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"61","author":"EJ Cand\u00e8s","year":"2015","unstructured":"Cand\u00e8s, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval via Wirtinger flow: theory and algorithms. IEEE Trans. Inf. Theory 61(4), 1985\u20132007 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"411_CR11","doi-asserted-by":"crossref","unstructured":"Cui, Y., Pang, J.-S.: Modern Nonconvex Nondifferentiable Optimization, volume\u00a029 of MOS-SIAM Series on Optimization. SIAM, (2021)","DOI":"10.1137\/1.9781611976748"},{"issue":"4","key":"411_CR12","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/060649021","volume":"29","author":"I Dhillon","year":"2008","unstructured":"Dhillon, I., Tropp, J.: Matrix nearness problems with Bregman divergences. SIAM J. Matrix Anal. Appl. 29(4), 1120\u20131146 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"411_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103(1), 1\u201343 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"411_CR14","doi-asserted-by":"crossref","unstructured":"Huang, M., Lai, M.-J., Varghese, A., Xu, Z.: On DC based methods for phase retrieval. In: Approximation Theory XVI, pp. 87\u2013121 (2019)","DOI":"10.1007\/978-3-030-57464-2_6"},{"issue":"3","key":"411_CR15","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. Annales de l\u2019Institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annales de l\u2019Institut Fourier"},{"issue":"1","key":"411_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10957-018-1345-y","volume":"179","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Huynh, V.N., Tao, P.D.: Convergence analysis of difference-of-convex algorithm with subanalytic data. J. Optim. Theory Appl. 179(1), 103\u2013126 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"411_CR17","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., Tao, P.D.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"411_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation I: Basic Theory","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I: Basic Theory. Springer (2006)"},{"issue":"5\u20136","key":"411_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1080\/02331930600816395","volume":"55","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S., Nam, N.M., Yen, N.D.: Fr\u00e9chet subdifferential calculus and optimality conditions in nondifferentiable programming. Optimization 55(5\u20136), 685\u2013708 (2006)","journal-title":"Optimization"},{"issue":"3","key":"411_CR20","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/19M1298007","volume":"2","author":"MC Mukkamala","year":"2020","unstructured":"Mukkamala, M.C., Ochs, P., Pock, T., Sabach, S.: Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization. SIAM J. Math. Data Sci. 2(3), 658\u2013682 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"411_CR21","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$\\mathit{O}(1\/k^2)$$. Soviet Math. Doklady 27, 372\u2013376 (1983)","journal-title":"Soviet Math. Doklady"},{"key":"411_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization. Springer Optimization and its Applications","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer Optimization and its Applications, 2nd edn. Springer (2018)","edition":"2"},{"key":"411_CR23","volume-title":"Variational Analysis Volume of 372, Grundlehren der Mathematischen Wissenschaften","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis Volume of 372, Grundlehren der Mathematischen Wissenschaften. Springer (1998)"},{"issue":"3","key":"411_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/MSP.2014.2352673","volume":"32","author":"Y Shechtman","year":"2015","unstructured":"Shechtman, Y., Eldar, Y.C., Cohen, O., Chapman, H.N., Miao, J., Segev, M.: Phase retrieval with application to optical imaging: a contemporary overview. IEEE Signal Process Magazine 32(3), 87\u2013109 (2015)","journal-title":"IEEE Signal Process Magazine"},{"issue":"4","key":"411_CR25","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10898-019-00828-4","volume":"76","author":"K Tu","year":"2020","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.\u00a076(4), 665\u2013693 (2020)","journal-title":"J. Global Optim."},{"key":"411_CR26","doi-asserted-by":"crossref","unstructured":"Tuy, H.: D. C. optimization: theory, methods and algorithms. In: Handbook of Global Optimization, vol. 25, pp. 149\u2013216 (1995)","DOI":"10.1007\/978-1-4615-2025-2_4"},{"key":"411_CR27","first-page":"2816","volume":"84","author":"H Wang","year":"2014","unstructured":"Wang, H., Banerjee, A.: Bregman alternating direction method of multipliers. Adv. Neural Inf. Process. Syst. 84, 2816\u20132824 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"411_CR28","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2), 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"411_CR29","doi-asserted-by":"publisher","first-page":"126515","DOI":"10.1109\/ACCESS.2019.2937005","volume":"7","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Barrio, R., Martinez, M.A., Jiang, H., Cheng, L.: Bregman proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. IEEE Access 7, 126515\u2013126529 (2019)","journal-title":"IEEE Access"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00411-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00411-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00411-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T11:20:10Z","timestamp":1669202410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00411-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,23]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["411"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00411-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,23]]},"assertion":[{"value":"11 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}