{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T09:47:50Z","timestamp":1767260870263,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T00:00:00Z","timestamp":1614729600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T00:00:00Z","timestamp":1614729600000},"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":["19H02379","19H00808"],"award-info":[{"award-number":["19H02379","19H00808"]}],"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":["20H00285","20K11698"],"award-info":[{"award-number":["20H00285","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":["20K14986"],"award-info":[{"award-number":["20K14986"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11590-021-01716-1","type":"journal-article","created":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T07:02:58Z","timestamp":1614754978000},"page":"2831-2860","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7780-8348","authenticated-orcid":false,"given":"Shummin","family":"Nakayama","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0097-7298","authenticated-orcid":false,"given":"Jun-ya","family":"Gotoh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,3]]},"reference":[{"issue":"3","key":"1716_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(3), 1637\u20131665 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1716_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized gauss-seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"1716_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"1\u20132","key":"1716_CR4","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\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"5\u20136","key":"1716_CR5","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\u20136), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"4","key":"1716_CR6","doi-asserted-by":"publisher","first-page":"3344","DOI":"10.1137\/18M117337X","volume":"28","author":"Y Cui","year":"2018","unstructured":"Cui, Y., Pang, J.S., Sen, B.: Composite difference-max programs for modern statistical estimation problems. SIAM J. Optim. 28(4), 3344\u20133374 (2018)","journal-title":"SIAM J. Optim."},{"issue":"456","key":"1716_CR7","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)","journal-title":"J. Am. Stat. Assoc."},{"key":"1716_CR8","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":"1716_CR9","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)","journal-title":"Math. Program."},{"key":"1716_CR10","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Advances in Neural Information Processing Systems, pp. 379\u2013387 (2015)"},{"issue":"5","key":"1716_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MSP.2020.3003845","volume":"37","author":"J Li","year":"2020","unstructured":"Li, J., So, A.M.C., Member, S.: Understanding notions of stationarity in non-smooth optimization. IEEE Signal Process. Mag. 37(5), 18\u201331 (2020)","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"1716_CR12","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(1), 69\u2013100 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1716_CR13","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)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1716_CR14","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1137\/18M1214342","volume":"29","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z.: Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming. SIAM J. Optim. 29(4), 2725\u20132752 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1716_CR15","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-018-1318-9","volume":"176","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z., Sun, Z.: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Program. 176(1\u20132), 369\u2013401 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"1716_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"JS Pang","year":"2017","unstructured":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing b-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1716_CR17","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.Q.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"key":"1716_CR18","volume-title":"Variational Anarysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Anarysis, 3rd edn. Springer, Berlin (2009)","edition":"3"},{"issue":"2","key":"1716_CR19","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."},{"issue":"7","key":"1716_CR20","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.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"1716_CR21","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H., et al.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"Mar","key":"1716_CR22","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(Mar), 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01716-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01716-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01716-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T01:31:52Z","timestamp":1632447112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01716-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,3]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1716"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01716-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,3,3]]},"assertion":[{"value":"17 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}