{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T02:09:09Z","timestamp":1769998149781,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T00:00:00Z","timestamp":1551052800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"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":[[2019,6]]},"DOI":"10.1007\/s10589-019-00081-1","type":"journal-article","created":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:21:57Z","timestamp":1551093717000},"page":"353-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Iteratively reweighted $$\\ell _1$$ \u2113 1 algorithms with extrapolation"],"prefix":"10.1007","volume":"73","author":[{"given":"Peiran","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5862-2986","authenticated-orcid":false,"given":"Ting Kei","family":"Pong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,25]]},"reference":[{"key":"81_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 invoving analytic features. Math. Program. 116, 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"81_CR2","doi-asserted-by":"publisher","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\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"81_CR3","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\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"81_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"81_CR5","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":"81_CR6","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":"81_CR7","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 systems. SIAM J. Optim. 17, 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"81_CR8","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, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"81_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex Analysis and Nonlinear Optimization","author":"J Borwein","year":"2006","unstructured":"Borwein, J., Lewis, A.: Convex Analysis and Nonlinear Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"81_CR10","volume-title":"Techniques in Variational Analysis","author":"J Borwein","year":"2005","unstructured":"Borwein, J., Zhu, Q.: Techniques in Variational Analysis. Springer, Berlin (2005)"},{"key":"81_CR11","doi-asserted-by":"publisher","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.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ \u2113 1 minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"81_CR12","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"81_CR13","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: IEEE International Conferenceon Acoustics, Speech and Signal Processing (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"81_CR14","doi-asserted-by":"publisher","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":"81_CR15","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1137\/17M1147378","volume":"11","author":"X Chen","year":"2018","unstructured":"Chen, X., Womersley, R.: Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere. SIAM J. Imaging Sci. 11, 1390\u20131415 (2018)","journal-title":"SIAM J. Imaging Sci."},{"key":"81_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10589-013-9553-8","volume":"59","author":"X Chen","year":"2014","unstructured":"Chen, X., Zhou, W.: Convergence of the reweighted $$\\ell _1$$ \u2113 1 minimization algorithm for $$\\ell _2-\\ell _p$$ \u2113 2 - \u2113 p minimization. Comput. Optim. Appl. 59, 47\u201361 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"81_CR17","doi-asserted-by":"publisher","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency ofminimizing compositions of convex functions and smooth maps. To appear in Math. Program. https:\/\/doi.org\/10.1007\/s10107-018-1311-3","DOI":"10.1007\/s10107-018-1311-3"},{"key":"81_CR18","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2013","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, New York (2013)"},{"key":"81_CR19","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, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"81_CR20","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","volume":"26","author":"S Foucart","year":"2009","unstructured":"Foucart, S., Lai, M.: Sparsest solutions of undertermined linear systems via $$l_p$$ l p -minimization for $$0<q\\le 1$$ 0 < q \u2264 1 . Appl. Comput. Harmonic Anal. 26, 395\u2013407 (2009)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"81_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A Mathematical Introduction to Compressive Sensing","author":"S Foucart","year":"2013","unstructured":"Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Springer, New York (2013)"},{"key":"81_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156, 59\u201399 (2016)","journal-title":"Math. Program."},{"key":"81_CR23","first-page":"37","volume":"28","author":"P Gong","year":"2013","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J.Z., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. Proc. Int. Conf. Mach. Learn. 28, 37\u201345 (2013)","journal-title":"Proc. Int. Conf. Mach. Learn."},{"key":"81_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with $$O(1\/\\epsilon )$$ O ( 1 \/ \u03f5 ) iteration-complexity for cone programming. Math. Program. 126, 1\u201329 (2011)","journal-title":"Math. Program."},{"key":"81_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-013-0722-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative reweighted minimization methods for $$l_p$$ l p regularized unconstrained nonlinear programming. Math. Program. 147, 277\u2013307 (2014)","journal-title":"Math. Program."},{"key":"81_CR26","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$O(1\/k^2)$$ O ( 1 \/ k 2 ) . Dokl. Akad. Nauk. SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"81_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Programming","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Programming. Kluwer Academic Publisher, Dordrecht (2004)"},{"key":"81_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120, 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"81_CR29","doi-asserted-by":"publisher","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 objective function. Math. Program. 140, 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"81_CR30","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: iPiano: inertial proximal algorithm for non-convex optimization. SIAM J. Imaging Sci. 7, 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"81_CR31","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. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"key":"81_CR32","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1137\/16M1064064","volume":"9","author":"T Pock","year":"2016","unstructured":"Pock, T., Sabach, S.: Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems. SIAM J. Imaging Sci. 9, 1756\u20131787 (2016)","journal-title":"SIAM J. Imaging Sci."},{"key":"81_CR33","doi-asserted-by":"publisher","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. 4, 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math."},{"key":"81_CR34","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (2009). (3rd printing)"},{"key":"81_CR35","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods and error bound for structured convex optimization. Math. Program. 125, 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"81_CR36","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. B"},{"key":"81_CR37","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":"81_CR38","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1109\/JSTSP.2010.2042413","volume":"4","author":"D Wipf","year":"2010","unstructured":"Wipf, D., Nagarajan, S.: Iterative reweighted $$\\ell _1$$ \u2113 1 and $$\\ell _2$$ \u2113 2 methods for finding sparse solutions. IEEE J. Sel. Topics Signal Process. 4, 317\u2013329 (2010)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"81_CR39","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., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"81_CR40","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6, 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"81_CR41","doi-asserted-by":"publisher","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":"81_CR42","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/110847445","volume":"22","author":"Y Zhao","year":"2012","unstructured":"Zhao, Y., Li, D.: Reweighted $$\\ell _1$$ \u2113 1 -minimization for sparse solutions to underdetermined linear systems. SIAM J. Optim. 22, 1065\u20131088 (2012)","journal-title":"SIAM J. Optim."},{"key":"81_CR43","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Trevor, H.: Regularization and variable selection via the elastic net. J. R. Stat. Soc. B 67, 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc. B"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00081-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00081-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00081-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T02:53:56Z","timestamp":1721012036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00081-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,25]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["81"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00081-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,25]]},"assertion":[{"value":"17 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}