{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T15:46:33Z","timestamp":1780415193645,"version":"3.54.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T00:00:00Z","timestamp":1508457600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hong Kong Research Grants Council","award":["PolyU153000\/15p"],"award-info":[{"award-number":["PolyU153000\/15p"]}]},{"name":"Hong Kong Research Grants Council","award":["PolyU153085\/16p"],"award-info":[{"award-number":["PolyU153085\/16p"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10589-017-9954-1","type":"journal-article","created":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T22:32:55Z","timestamp":1508452375000},"page":"297-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":137,"title":["A proximal difference-of-convex algorithm with extrapolation"],"prefix":"10.1007","volume":"69","author":[{"given":"Bo","family":"Wen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8053-0121","authenticated-orcid":false,"given":"Xiaojun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ting Kei","family":"Pong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,10,20]]},"reference":[{"key":"9954_CR1","doi-asserted-by":"crossref","unstructured":"Ahn, M., Pang, J.S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Optim. 27, 1637\u20131665 (2017)","DOI":"10.1137\/16M1084754"},{"key":"9954_CR2","doi-asserted-by":"crossref","first-page":"2984","DOI":"10.1109\/TSP.2014.2315167","volume":"62","author":"A Alvarado","year":"2014","unstructured":"Alvarado, A., Scutari, G., Pang, J.S.: A new decomposition method for multiuser DC-programming and its applications. IEEE Trans. Signal Process. 62, 2984\u20132998 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"9954_CR3","doi-asserted-by":"crossref","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. Progr. Ser. B 116, 5\u201316 (2009)","journal-title":"Math. Progr. Ser. B"},{"key":"9954_CR4","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"9954_CR5","doi-asserted-by":"crossref","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\u2013backward splitting, and regularized Gauss-Seidel methods. Math. Progr. Ser. A 137, 91\u2013129 (2013)","journal-title":"Math. Progr. Ser. A"},{"key":"9954_CR6","unstructured":"Banert, S., Bo\u0163, R.I.: A general double-proximal gradient algorithm for d.c. programming. arXiv preprint \n                        arXiv:1610.06538v1"},{"key":"9954_CR7","doi-asserted-by":"crossref","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":"9954_CR8","doi-asserted-by":"crossref","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. Progr. Comput. 3, 165\u2013218 (2011)","journal-title":"Math. Progr. Comput."},{"key":"9954_CR9","doi-asserted-by":"publisher","unstructured":"Bian, W., Chen, X.: Optimality and complexity for constrained optimization problems with nonconvex regularization. Math. Oper. Res. (2017). doi:\n                        10.1287\/moor.2016.0837","DOI":"10.1287\/moor.2016.0837"},{"key":"9954_CR10","doi-asserted-by":"crossref","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 systems. SIAM J. Optim. 17, 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"9954_CR11","doi-asserted-by":"crossref","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. Progr. Ser. A 146, 459\u2013494 (2014)","journal-title":"Math. Progr. Ser. A"},{"key":"9954_CR12","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M., Boyd, S.: Enhancing sparsity by reweighted \n                        $$\\ell _{1}$$\n                        \n                            \n                                \n                                    \u2113\n                                    1\n                                \n                            \n                        \n                     minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"9954_CR13","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1137\/15M1028054","volume":"26","author":"X Chen","year":"2016","unstructured":"Chen, X., Lu, Z., Pong, T.K.: Penalty methods for a class of non-Lipschitz optimization problems. SIAM J. Optim. 26, 1465\u20131492 (2016)","journal-title":"SIAM J. Optim."},{"key":"9954_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume":"49","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal splitting methods in signal processing. Fixed-Point Algorithms Inverse Probl. Sci. Eng. 49, 185\u2013212 (2011)","journal-title":"Fixed-Point Algorithms Inverse Probl. Sci. Eng."},{"key":"9954_CR15","doi-asserted-by":"crossref","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, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"9954_CR16","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: ICML (2013)"},{"key":"9954_CR17","doi-asserted-by":"publisher","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Progr. Ser. B. (2017). doi:\n                        10.1007\/s10107-017-1181-0","DOI":"10.1007\/s10107-017-1181-0"},{"key":"9954_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Thi Le","year":"2005","unstructured":"Le Thi, H.A., Pham, D.T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9954_CR19","first-page":"169","volume":"27","author":"HA Thi Le","year":"1999","unstructured":"Le Thi, H.A., Pham, D.T., Le, D.M.: Exact penalty in D.C. programming. Vietnam J. Math. 27, 169\u2013178 (1999)","journal-title":"Vietnam J. Math."},{"key":"9954_CR20","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"HA Thi Le","year":"2012","unstructured":"Le Thi, H.A., Pham, D.T., Huynh, V.N.: Exact penalty and error bounds in DC programming. J. Glob. Optim. 52, 509\u2013535 (2012)","journal-title":"J. Glob. Optim."},{"key":"9954_CR21","doi-asserted-by":"publisher","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka-\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. (2017). doi:\n                        10.1007\/s10208-017-9366-8","DOI":"10.1007\/s10208-017-9366-8"},{"key":"9954_CR22","doi-asserted-by":"crossref","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":"9954_CR23","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate \n                        $$O(\\frac{1}{k^2})$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    \n                                        1\n                                        \n                                            k\n                                            2\n                                        \n                                    \n                                    )\n                                \n                            \n                        \n                    . Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"9954_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Boston (2004)"},{"key":"9954_CR25","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Progr. Ser. B 109, 319\u2013344 (2007)","journal-title":"Math. Progr. Ser. B"},{"key":"9954_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Progr. Ser. B 140, 125\u2013161 (2013)","journal-title":"Math. Progr. Ser. B"},{"key":"9954_CR27","doi-asserted-by":"crossref","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. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"key":"9954_CR28","first-page":"289","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"9954_CR29","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"DT Pham","year":"1998","unstructured":"Pham, D.T., Le Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"9954_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4, 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"9954_CR31","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., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"9954_CR32","doi-asserted-by":"crossref","first-page":"1950","DOI":"10.1109\/TSP.2014.2303946","volume":"62","author":"M Sanjabi","year":"2014","unstructured":"Sanjabi, M., Razaviyayn, M., Luo, Z.-Q.: Optimal joint base station assignment and beamforming for heterogeneous networks. IEEE Trans. Signal Process. 62, 1950\u20131961 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"9954_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Convex Analysis and Global Optimization, 2nd edn. Springer, Berlin (2016)","edition":"2"},{"key":"9954_CR34","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"9954_CR35","doi-asserted-by":"crossref","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 \n                        $$\\ell _{1-2}$$\n                        \n                            \n                                \n                                    \u2113\n                                    \n                                        1\n                                        -\n                                        2\n                                    \n                                \n                            \n                        \n                     for compressed sensing. SIAM J. Sci. Comput. 37, A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"9954_CR36","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C Zhang","year":"2010","unstructured":"Zhang, C.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"9954_CR37","unstructured":"Zhang, S., Xin, J.: Minimization of transformed \n                        $$L_1$$\n                        \n                            \n                                \n                                    L\n                                    1\n                                \n                            \n                        \n                     penalty: theory, difference of convex function algorithm, and robust application in compressed sensing. arXiv preprint \n                        arXiv:1411.5735v3"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9954-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9954-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9954-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T13:24:37Z","timestamp":1519651477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9954-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,20]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["9954"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9954-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,20]]}}}