{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:11:21Z","timestamp":1772446281422,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T00:00:00Z","timestamp":1694736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T00:00:00Z","timestamp":1694736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["20K14986"],"award-info":[{"award-number":["20K14986"]}],"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":["20K11698"],"award-info":[{"award-number":["20K11698"]}],"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":["18K11179"],"award-info":[{"award-number":["18K11179"]}],"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":["23K10999"],"award-info":[{"award-number":["23K10999"]}],"id":[{"id":"10.13039\/501100001691","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":[[2024,3]]},"DOI":"10.1007\/s10589-023-00525-9","type":"journal-article","created":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T16:01:57Z","timestamp":1694793717000},"page":"611-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Inexact proximal DC Newton-type method for nonconvex composite functions"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7780-8348","authenticated-orcid":false,"given":"Shummin","family":"Nakayama","sequence":"first","affiliation":[]},{"given":"Yasushi","family":"Narushima","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Yabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,15]]},"reference":[{"key":"525_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"issue":"1","key":"525_CR2","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. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"525_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(4), 2445\u20132481 (2019). https:\/\/doi.org\/10.1137\/18M1167152","journal-title":"SIAM J. Optim."},{"issue":"3","key":"525_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"SR Becker","year":"2011","unstructured":"Becker, S.R., Cand\u00e8s, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3(3), 165 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0029-5","journal-title":"Math. Program. Comput."},{"issue":"2","key":"525_CR5","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(2), 375\u2013396 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0941-y","journal-title":"Math. Program."},{"issue":"5","key":"525_CR6","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Fourier Anal. Appl. 14(5), 877\u2013905 (2008). https:\/\/doi.org\/10.1007\/s00041-008-9045-x","journal-title":"J. Fourier Anal. Appl."},{"key":"525_CR7","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"525_CR8","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. 1. Springer, New York (2003)"},{"key":"525_CR9","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. 2. Springer, New York (2003)"},{"issue":"456","key":"525_CR10","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001). https:\/\/doi.org\/10.1198\/016214501753382273","journal-title":"J. Am. Stat. Assoc."},{"issue":"8","key":"525_CR11","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M Fukushima","year":"1981","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12(8), 989\u20131000 (1981). https:\/\/doi.org\/10.1080\/00207728108963798","journal-title":"Int. J. Syst. Sci."},{"key":"525_CR12","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)"},{"issue":"1","key":"525_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J Gotoh","year":"2018","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program. 169(1), 141\u2013176 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1181-0","journal-title":"Math. Program."},{"issue":"3","key":"525_CR14","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(3), 641\u2013674 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00059-z","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"525_CR15","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(3), 1420\u20131443 (2014). https:\/\/doi.org\/10.1137\/130921428","journal-title":"SIAM J. Optim."},{"key":"525_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"DH Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15\u201335 (2001). https:\/\/doi.org\/10.1016\/S0377-0427(00)00540-9","journal-title":"J. Comput. Appl. Math."},{"key":"525_CR17","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Advances in Neural Information Processing Systems, pp. 379\u2013387 (2015)"},{"issue":"1","key":"525_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(1), 19\u201341 (2017). https:\/\/doi.org\/10.1007\/s00186-016-0566-9","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"525_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10589-022-00357-z","volume":"82","author":"T Liu","year":"2021","unstructured":"Liu, T., Takeda, A.: An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems. Comput. Optim. Appl. 82(1), 141\u2013173 (2021). https:\/\/doi.org\/10.1007\/s10589-022-00357-z","journal-title":"Comput. Optim. Appl."},{"key":"525_CR20","unstructured":"Liu X., Hsieh C.J., Lee J.D., Sun Y.: An inexact subsampled proximal Newton-type method for large-scale machine learning (2017). arXiv preprint arXiv:1708.08552"},{"issue":"4","key":"525_CR21","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1287\/moor.2017.0905","volume":"43","author":"Z Lu","year":"2018","unstructured":"Lu, Z., Li, X.: Sparse recovery via partial regularization: models, theory, and algorithms. Math. Oper. Res. 43(4), 1290\u20131316 (2018). https:\/\/doi.org\/10.1287\/moor.2017.0905","journal-title":"Math. Oper. Res."},{"key":"525_CR22","doi-asserted-by":"publisher","first-page":"2831","DOI":"10.1007\/s11590-021-01716-1","volume":"15","author":"S Nakayama","year":"2021","unstructured":"Nakayama, S., Gotoh, J.: On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression. Optim. Lett. 15, 2831\u20132860 (2021). https:\/\/doi.org\/10.1007\/s11590-021-01716-1","journal-title":"Optim. Lett."},{"issue":"4","key":"525_CR23","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.3934\/jimo.2018122","volume":"15","author":"S Nakayama","year":"2019","unstructured":"Nakayama, S., Narushima, Y., Yabe, H.: Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization. J. Ind. Manag. Optim. 15(4), 1773\u20131793 (2019). https:\/\/doi.org\/10.3934\/jimo.2018122","journal-title":"J. Ind. Manag. Optim."},{"issue":"1","key":"525_CR24","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(1), 127\u2013154 (2021). https:\/\/doi.org\/10.1007\/s10589-021-00264-9","journal-title":"Comput. Optim. Appl."},{"issue":"151","key":"525_CR25","doi-asserted-by":"publisher","first-page":"773","DOI":"10.2307\/2006193","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980). https:\/\/doi.org\/10.2307\/2006193","journal-title":"Math. Comput."},{"key":"525_CR26","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006)"},{"key":"525_CR27","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Stella, L., Bemporad, A.: Forward-backward truncated Newton methods for convex composite optimization (2014). arXiv:1402.6655","DOI":"10.1109\/CDC.2013.6760233"},{"issue":"1","key":"525_CR28","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L Qi","year":"1993","unstructured":"Qi, L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18(1), 227\u2013244 (1993). https:\/\/doi.org\/10.1287\/moor.18.1.227","journal-title":"Math. Oper. Res."},{"key":"525_CR29","doi-asserted-by":"crossref","unstructured":"Qi, L., Sun, D.: A survey of some nonsmooth equations and smoothing Newton methods. In: Progress in Optimization, pp. 121\u2013146. Springer (1999)","DOI":"10.1007\/978-1-4613-3285-5_7"},{"issue":"1","key":"525_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s101079900127","volume":"87","author":"L Qi","year":"2000","unstructured":"Qi, L., Sun, D., Zhou, G.: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Program. 87(1), 1\u201335 (2000). https:\/\/doi.org\/10.1007\/s101079900127","journal-title":"Math. Program."},{"issue":"1","key":"525_CR31","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi, L., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Program. 58(1), 353\u2013367 (1993). https:\/\/doi.org\/10.1007\/BF01581275","journal-title":"Math. Program."},{"issue":"3","key":"525_CR32","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/TNNLS.2015.2418224","volume":"27","author":"A Rakotomamonjy","year":"2015","unstructured":"Rakotomamonjy, A., Flamary, R., Gasso, G.: DC proximal Newton for nonconvex optimization problems. IEEE Trans. Neural Netw. Learn. Syst. 27(3), 636\u2013647 (2015). https:\/\/doi.org\/10.1109\/TNNLS.2015.2418224","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"525_CR33","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(1), 495\u2013529 (2016). https:\/\/doi.org\/10.1007\/s10107-016-0997-3","journal-title":"Math. Program."},{"key":"525_CR34","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)"},{"issue":"1","key":"525_CR35","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., Hoai An, L.T.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"2","key":"525_CR36","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). https:\/\/doi.org\/10.1007\/s10589-017-9954-1","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"525_CR37","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2018","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76(1), 364\u2013389 (2018). https:\/\/doi.org\/10.1007\/s10915-017-0624-3","journal-title":"J. Sci. Comput."},{"issue":"1","key":"525_CR38","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). https:\/\/doi.org\/10.1137\/140952363","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"525_CR39","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(2), 894\u2013942 (2010). https:\/\/doi.org\/10.1214\/09-AOS729","journal-title":"Ann. Stat."},{"key":"525_CR40","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11, 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00525-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00525-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00525-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T13:05:59Z","timestamp":1708088759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00525-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,15]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["525"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00525-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,15]]},"assertion":[{"value":"14 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}