{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T11:52:08Z","timestamp":1776081128317,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T00:00:00Z","timestamp":1646179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T00:00:00Z","timestamp":1646179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["No.19H04069"],"award-info":[{"award-number":["No.19H04069"]}],"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":"crossref","award":["No. 17H01699"],"award-info":[{"award-number":["No. 17H01699"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["No.19H04069"],"award-info":[{"award-number":["No.19H04069"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10589-022-00357-z","type":"journal-article","created":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T12:02:31Z","timestamp":1646222551000},"page":"141-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7096-2668","authenticated-orcid":false,"given":"Tianxiang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Akiko","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,2]]},"reference":[{"key":"357_CR1","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"M Ahn","year":"2017","unstructured":"Ahn, M., Pang, J.S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Optim. 27, 1637\u20131665 (2017)","journal-title":"SIAM J. Optim."},{"key":"357_CR2","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"357_CR3","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1137\/18M1167152","volume":"29","author":"S Becker","year":"2019","unstructured":"Becker, S., Fadili, J., Ochs, P.: On quasi-Newton forward-backward splitting: proximal calculus and convergence. SIAM J. Optim. 29, 2445\u20132482 (2019)","journal-title":"SIAM J. Optim."},{"key":"357_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"S Becker","year":"2011","unstructured":"Becker, S., Cand\u00e8s, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3, 165\u2013218 (2011)","journal-title":"Math. Program. Comput."},{"key":"357_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search-based methods for nonsmooth optimization. SIAM J. Optim. 26, 891\u2013921 (2016)","journal-title":"SIAM J. Optim."},{"key":"357_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10107-015-0941-y","volume":"157","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Nocedal, J., Oztoprak, F.: An inexact successive quadratic approximation method for $$L$$-1 regularized optimization. Math. Program. 157, 375\u2013396 (2016)","journal-title":"Math. Program."},{"key":"357_CR7","doi-asserted-by":"publisher","first-page":"A2558","DOI":"10.1137\/15M1025098","volume":"38","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Porta, F., Ruggiero, V.: A variable metric forward-backward method with extrapolation. SIAM J. Sci. Comput. 38, A2558\u2013A2584 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"357_CR8","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. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"357_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10957-013-0465-7","volume":"162","author":"E Chouzenoux","year":"2014","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function. J. Optim. Theory Appl. 162, 107\u2013132 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"357_CR10","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"456","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 456, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"357_CR11","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10589-017-9964-z","volume":"69","author":"H Ghanbari","year":"2018","unstructured":"Ghanbari, H., Scheinberg, K.: Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates. Comput. Optim. Appl. 69, 597\u2013627 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"357_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"JY Gotoh","year":"2018","unstructured":"Gotoh, J.Y., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program. 169, 141\u2013176 (2018)","journal-title":"Math. Program."},{"key":"357_CR13","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In: International Conference on Machine Learning, pp. 37\u201345 (2013)"},{"key":"357_CR14","doi-asserted-by":"crossref","unstructured":"Kanzow, C., Lechner, T.: Globalized inexact proximal Newton-type methods for nonconvex composite functions. https:\/\/www.mathematik.uni-wuerzburg.de\/fileadmin\/10040700\/paper\/ProxNewton.pdf (2020)","DOI":"10.1007\/s10589-020-00243-6"},{"key":"357_CR15","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1137\/140966587","volume":"27","author":"S Karimi","year":"2017","unstructured":"Karimi, S., Vavasis, S.: IMRO: a proximal quasi-Newton method for solving $$\\ell _1$$-regularized least squares problems. SIAM J. Optim. 27, 583\u2013615 (2017)","journal-title":"SIAM J. Optim."},{"key":"357_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10589-019-00059-z","volume":"72","author":"CP Lee","year":"2019","unstructured":"Lee, C.P., Wright, S.J.: Inexact successive quadratic approximation for regularized optimization. Comput. Optim. Appl. 72, 641\u2013674 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"357_CR17","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.P.: Peaceman-Rachford splitting for a class of nonconvex optimization problems. Comput. Optim. Appl. 68, 407\u2013436 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"357_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00186-016-0566-9","volume":"85","author":"J Li","year":"2017","unstructured":"Li, J., Andersen, M.S., Vandenberghe, L.: Inexact proximal Newton methods for self-concordant functions. Math. Methods Oper. Res. 85, 19\u201341 (2017)","journal-title":"Math. Methods Oper. Res."},{"key":"357_CR19","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Advances in Neural Information Processing Systems, pp. 379\u2013387 (2015)"},{"key":"357_CR20","doi-asserted-by":"publisher","first-page":"1408","DOI":"10.1137\/17M1125157","volume":"29","author":"H Lin","year":"2019","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: An inexact variable metric proximal point algorithm for generic quasi-Newton acceleration. SIAM J. Optim. 29, 1408\u20131443 (2019)","journal-title":"SIAM J. Optim."},{"key":"357_CR21","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24, 1420\u20131443 (2014)","journal-title":"SIAM J. Optim."},{"key":"357_CR22","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28, 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"key":"357_CR23","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10589-017-9900-2","volume":"67","author":"T Liu","year":"2017","unstructured":"Liu, T., Pong, T.K.: Further properties of the forward-backward envelope with applications to difference-of-convex programming. Comput. Optim. Appl. 67, 489\u2013520 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"357_CR24","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 pDCA$$_e$$ with applications to simultaneous sparse recovery and outlier detection. Comput. Optim. Appl. 73, 69\u2013100 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"357_CR25","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-018-1327-8","volume":"176","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Program. 176, 339\u2013367 (2019)","journal-title":"Math. Program."},{"key":"357_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/0802004","volume":"2","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2, 43\u201354 (1992)","journal-title":"SIAM J. Optim."},{"key":"357_CR27","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2018","unstructured":"Lou, Y., Yan, M.: Fast L$$_1$$-L$$_2$$ minimization via a proximal operator. J. Sci. Comput. 74, 767\u2013785 (2018)","journal-title":"J. Sci. Comput."},{"key":"357_CR28","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1137\/16M1098929","volume":"10","author":"TH Ma","year":"2017","unstructured":"Ma, T.H., Lou, Y., Huang, T.Z.: Truncated $$\\ell _{1-2}$$ models for sparse recovery and rank minimization. SIAM J. Imaging Sci. 10, 1346\u20131380 (2017)","journal-title":"SIAM J. Imaging Sci."},{"key":"357_CR29","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10589-021-00264-9","volume":"79","author":"S Nakayama","year":"2021","unstructured":"Nakayama, S., Narushima, Y., Yabe, H.: Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions. Comput. Optim. Appl. 79, 127\u2013154 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"357_CR30","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019donoghue","year":"2015","unstructured":"O\u2019donoghue, B., Cand\u00e8s, E.J.: Adaptive restart for accelerated gradient schemes. J. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"J. Found. Comput. Math."},{"key":"357_CR31","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10898-020-00892-1","volume":"78","author":"W Peng","year":"2020","unstructured":"Peng, W., Zhang, H., Zhang, X., Cheng, L.: Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions. J. Glob. Optim. 78, 69\u201389 (2020)","journal-title":"J. Glob. Optim."},{"key":"357_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"357_CR33","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1137\/16M1073741","volume":"27","author":"S Salzo","year":"2017","unstructured":"Salzo, S.: The variable metric forward-backward splitting algorithm under mild differentiability assumptions. SIAM J. Optim. 27, 2153\u20132181 (2017)","journal-title":"SIAM J. Optim."},{"key":"357_CR34","unstructured":"Schmidt, M., Roux, N. L., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Advances in Neural Information Processing Systems, pp. 1458\u20131466 (2011)"},{"key":"357_CR35","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-016-0997-3","volume":"160","author":"K Scheinberg","year":"2016","unstructured":"Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. 160, 495\u2013529 (2016)","journal-title":"Math. Program."},{"key":"357_CR36","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward-backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67, 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"357_CR37","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., An, L.T.H.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Mathematica Vietnamica 22, 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"key":"357_CR38","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"357_CR39","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, 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"357_CR40","doi-asserted-by":"publisher","unstructured":"Wang, Y., Luo, Z., Zhang, X.: New improved penalty methods for sparse reconstruction based on difference of two norms. Available at researchgate. https:\/\/doi.org\/10.13140\/RG.2.1.3256.3369.","DOI":"10.13140\/RG.2.1.3256.3369."},{"key":"357_CR41","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"357_CR42","unstructured":"Yang, L.: Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems. https:\/\/arxiv.org\/abs\/1711.06831"},{"key":"357_CR43","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, A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"357_CR44","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10107-018-1280-6","volume":"174","author":"MC Yue","year":"2019","unstructured":"Yue, M.C., Zhou, Z., So, A.M.C.: A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property. Math. Program. 174, 327\u2013358 (2019)","journal-title":"Math. Program."},{"key":"357_CR45","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00357-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00357-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00357-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T12:08:37Z","timestamp":1649506117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00357-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,2]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["357"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00357-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,2]]},"assertion":[{"value":"24 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}