{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:42:35Z","timestamp":1784644955597,"version":"3.55.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T00:00:00Z","timestamp":1664928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T00:00:00Z","timestamp":1664928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["12001367"],"award-info":[{"award-number":["12001367"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["21ZR1442800"],"award-info":[{"award-number":["21ZR1442800"]}],"id":[{"id":"10.13039\/100007219","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":[[2022,12]]},"DOI":"10.1007\/s10589-022-00416-5","type":"journal-article","created":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T18:02:47Z","timestamp":1664992967000},"page":"967-997","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An extrapolated iteratively reweighted $$\\ell _1$$ method with complexity analysis"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8821-7260","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiashan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,5]]},"reference":[{"issue":"1","key":"416_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"Hedy Attouch","year":"2009","unstructured":"Attouch, Hedy, Bolte, J\u00e9r\u00f4me.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"416_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H\u00e9dy Attouch","year":"2010","unstructured":"Attouch, H\u00e9dy., Bolte, J\u00e9r\u00f4me., Redont, Patrick, Soubeyran, Antoine: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the kurdyka-\u0142ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"416_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-backward splitting, and regularized gauss-seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"3","key":"416_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"Alfred Auslender","year":"2006","unstructured":"Auslender, Alfred, Teboulle, Marc: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3), 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"416_CR5","unstructured":"Bauschke,H.H.,  Dao, M.N.,  Moursi, W.M.: On fej$$\\backslash $$\u2019er monotone sequences and nonexpansive mappings. arXiv preprint arXiv:1507.05585, 2015"},{"issue":"1","key":"416_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"Amir Beck","year":"2009","unstructured":"Beck, Amir, Teboulle, Marc: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"3","key":"416_CR7","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)","journal-title":"Math. Program. comput."},{"issue":"4","key":"416_CR8","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 \u0142ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"416_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J\u00e9r\u00f4me Bolte","year":"2014","unstructured":"Bolte, J\u00e9r\u00f4me., Sabach, Shoham, Teboulle, Marc: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"5\u20136","key":"416_CR10","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."},{"key":"416_CR11","doi-asserted-by":"crossref","unstructured":"Chartrand, R.,  Yin, W.: Iteratively reweighted algorithms for compressive sensing. In 2008 IEEE International conference on acoustics, speech and signal processing, pp. 3869\u20133872. IEEE, 2008","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"416_CR12","volume-title":"Convergence of reweighted $$\\ell _1$$ minimization algorithms and unique solution of truncated lp minimization","author":"Xiaojun Chen","year":"2010","unstructured":"Chen, Xiaojun, Zhou, Weijun: Convergence of reweighted $$\\ell _1$$ minimization algorithms and unique solution of truncated lp minimization. The Hong Kong Polytechnic University, Department of Applied Mathematics (2010)"},{"issue":"456","key":"416_CR13","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"Jianqing Fan","year":"2001","unstructured":"Fan, Jianqing, Li, Runze: 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."},{"issue":"4","key":"416_CR14","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"Figueiredo, M.A.T., Nowak, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Selected Topics Signal Process. 1(4), 586\u2013597 (2007)","journal-title":"IEEE J. Selected Topics Signal Process."},{"issue":"3","key":"416_CR15","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"Pierre Frankel","year":"2015","unstructured":"Frankel, Pierre, Garrigos, Guillaume, Peypouquet, Juan: Splitting methods with variable metric for kurdyka-\u0142ojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165(3), 874\u2013900 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"416_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-011-0470-2","volume":"129","author":"Dongdong Ge","year":"2011","unstructured":"Ge, Dongdong, Jiang, Xiaoye, Ye, Yinyu: A note on the complexity of $$\\ell _p$$ minimization. Math. Program. 129(2), 285\u2013299 (2011)","journal-title":"Math. Program."},{"issue":"4","key":"416_CR17","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10898-020-00955-3","volume":"79","author":"Hu Yaohua","year":"2021","unstructured":"Yaohua, Hu., Li, Chong, Meng, Kaiwen, Yang, Xiaoqi: Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems. J. Global Optim. 79(4), 853\u2013883 (2021)","journal-title":"J. Global Optim."},{"key":"416_CR18","unstructured":"Jaggi, M.: Sparse convex optimization methods for machine learning. PhD Thesis, ETH Zurich, 2011"},{"issue":"1","key":"416_CR19","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"Ming-Jun Lai","year":"2011","unstructured":"Lai, Ming-Jun., Wang, Jingyue: An unconstrained $$ \\ell _q $$ minimization with $$0<q\\le 1$$ for sparse solution of underdetermined linear systems. SIAM J. Optim. 21(1), 82\u2013101 (2011)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"416_CR20","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 )$$ iteration-complexity for cone programming. Math. Program. 126(1), 1\u201329 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"416_CR21","first-page":"371","volume":"159","author":"Guoyin Li and Ting Kei Pong","year":"2016","unstructured":"Guoyin Li and Ting Kei Pong: Douglas-rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159(1), 371\u2013401 (2016)","journal-title":"Math. Program."},{"issue":"5","key":"416_CR22","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"Guoyin Li and Ting Kei Pong","year":"2018","unstructured":"Guoyin Li and Ting Kei Pong: Calculus of the exponent of kurdyka-\u0142ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18(5), 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"416_CR23","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10479-006-0145-1","volume":"152","author":"MS Lobo","year":"2007","unstructured":"Lobo, M.S., Fazel, M., Boyd, S.: Portfolio optimization with linear and fixed transaction costs. Annal Operat. Res. 152(1), 341\u2013365 (2007)","journal-title":"Annal Operat. Res."},{"key":"416_CR24","unstructured":"Canyi Lu, Yunchao Wei, Zhouchen Lin, Shuicheng Yan.: Proximal iteratively reweighted algorithm with multiple splitting for nonconvex sparsity optimization. In Twenty-Eighth AAAI conference on artificial intelligence, 2014"},{"issue":"1\u20132","key":"416_CR25","first-page":"277","volume":"147","author":"Lu Zhaosong","year":"2014","unstructured":"Zhaosong, Lu.: Iterative reweighted minimization methods for $$\\ell _p$$ regularized unconstrained nonlinear programming. Math. Program. 147(1\u20132), 277\u2013307 (2014)","journal-title":"Math. Program."},{"key":"416_CR26","doi-asserted-by":"crossref","unstructured":"Weixin Luo, Wen Liu, and Shenghua Gao.: A revisit of sparse coding based anomaly detection in stacked rnn framework. In Proceedings of the IEEE international conference on computer vision, pp. 341\u2013349, 2017","DOI":"10.1109\/ICCV.2017.45"},{"key":"416_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical programs with equilibrium constraints","author":"Zhi-Quan Luo","year":"1996","unstructured":"Luo, Zhi-Quan., Pang, Jong-Shi., Ralph, Daniel: Mathematical programs with equilibrium constraints. Cambridge University Press, Cambridge (1996)"},{"issue":"6","key":"416_CR28","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1002\/mrm.21391","volume":"58","author":"M Lustig","year":"2007","unstructured":"Lustig, M., Donoho, D., Pauly, J.M.: Sparse mri: the application of compressed sensing for rapid mr imaging. Magnetic Resonance Med.: Official J. Int. Soc. Magnetic Resonance Med. 58(6), 1182\u20131195 (2007)","journal-title":"Magnetic Resonance Med.: Official J. Int. Soc. Magnetic Resonance Med."},{"issue":"1","key":"416_CR29","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/TIP.2007.911828","volume":"17","author":"Julien Mairal","year":"2007","unstructured":"Mairal, Julien, Elad, Michael, Sapiro, Guillermo: Sparse representation for color image restoration. IEEE Trans. Image Process. 17(1), 53\u201369 (2007)","journal-title":"IEEE Trans. Image Process."},{"issue":"Jan","key":"416_CR30","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11(Jan), 19\u201360 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"416_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Yu Nesterov","year":"2013","unstructured":"Nesterov, Yu.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"416_CR32","first-page":"5","volume":"3","author":"Yurii Nesterov","year":"1998","unstructured":"Nesterov, Yurii: Introductory lectures on convex programming volume i: basic course. Lecture Notes 3(4), 5 (1998)","journal-title":"Lecture Notes"},{"issue":"1","key":"416_CR33","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Yurii Nesterov","year":"2009","unstructured":"Nesterov, Yurii: Primal-dual subgradient methods for convex problems. Math. Program. 120(1), 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"416_CR34","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate o (1\/k$$\\hat{}$$ 2). In Dokl. Akad. Nauk Sssr 269, 543\u2013547 (1983)","journal-title":"In Dokl. Akad. Nauk Sssr"},{"issue":"2","key":"416_CR35","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"Paul Tseng","year":"2010","unstructured":"Tseng, Paul: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125(2), 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"416_CR36","volume-title":"Study on the Kurdyka-\u0141ojasiewicz exponents of $$\\ell _p$$ regularization functions (in Chinese)","author":"Feng Wang","year":"2021","unstructured":"Wang, Feng: Study on the Kurdyka-\u0141ojasiewicz exponents of $$\\ell _p$$ regularization functions (in Chinese). PhD thesis Southwest Jiaotong University, Chengdu (2021)"},{"key":"416_CR37","unstructured":"Wang, H.,Zeng, H., Wang, J.: Relating $$\\ell _p$$ regularization and reweighted $$\\ell _1$$ regularization. arXiv preprint arXiv:1912.00723, 2019"},{"issue":"2","key":"416_CR38","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":"3","key":"416_CR39","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Xu Yangyang","year":"2013","unstructured":"Yangyang, Xu., Yin, Wotao: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imag. Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imag. Sci."},{"issue":"2","key":"416_CR40","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10589-019-00081-1","volume":"73","author":"Peiran Yu and Ting Kei Pong","year":"2019","unstructured":"Peiran Yu and Ting Kei Pong: Iteratively reweighted $$\\ell _1$$ algorithms with extrapolation. Comput. Optim. Appl. 73(2), 353\u2013386 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"416_CR41","first-page":"1","volume":"22","author":"P Yu","year":"2021","unstructured":"Yu, P., Li, G., Pong, T.K.: Kurdyka-\u0142ojasiewicz exponent via inf-projection. Found. Comput. Math. 22, 1\u201347 (2021)","journal-title":"Found. Comput. Math."},{"issue":"19","key":"416_CR42","doi-asserted-by":"publisher","first-page":"5106","DOI":"10.1109\/TSP.2016.2595499","volume":"64","author":"Jinshan Zeng","year":"2016","unstructured":"Zeng, Jinshan, Lin, Shaobo, Zongben, Xu.: Sparse regularization: convergence of iterative jumping thresholding algorithm. IEEE Trans. Signal Process. 64(19), 5106\u20135118 (2016)","journal-title":"IEEE Trans. Signal Process."},{"key":"416_CR43","doi-asserted-by":"crossref","unstructured":"Roman Zeyde, Michael Elad, Matan Protter.: On single image scale-up using sparse-representations. In International conference on curves and surfaces, pp. 711\u2013730. Springer, 2010","DOI":"10.1007\/978-3-642-27413-8_47"},{"issue":"2","key":"416_CR44","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"Cun-Hui Zhang","year":"2010","unstructured":"Zhang, Cun-Hui., et al.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 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-00416-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00416-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00416-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T11:21:03Z","timestamp":1669202463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00416-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,5]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["416"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00416-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,5]]},"assertion":[{"value":"12 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors disclosed no relevant relationships.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}