{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T21:14:00Z","timestamp":1769634840447,"version":"3.49.0"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1846690"],"award-info":[{"award-number":["1846690"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1924935"],"award-info":[{"award-number":["1924935"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1952339"],"award-info":[{"award-number":["1952339"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2152762"],"award-info":[{"award-number":["2152762"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2208361"],"award-info":[{"award-number":["2208361"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DE-SC","award":["0021142"],"award-info":[{"award-number":["0021142"]}]},{"name":"DE-SC","award":["0002722"],"award-info":[{"award-number":["0002722"]}]},{"name":"DE-SC","award":["2012439"],"award-info":[{"award-number":["2012439"]}]},{"name":"DE-SC","award":["1821144"],"award-info":[{"award-number":["1821144"]}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2143915"],"award-info":[{"award-number":["2143915"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10915-023-02148-y","type":"journal-article","created":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T05:03:00Z","timestamp":1678251780000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum"],"prefix":"10.1007","volume":"95","author":[{"given":"Mengqi","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1973-5704","authenticated-orcid":false,"given":"Yifei","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"issue":"1","key":"2148_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1093\/imanum\/5.1.121","volume":"5","author":"M Al-Baali","year":"1985","unstructured":"Al-Baali, M.: Descent property and global convergence of the Fletcher-Reeves method with inexact line search. IMA J. Numer. Anal. 5(1), 121\u2013124 (1985)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"2148_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11075-007-9152-9","volume":"47","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: Another hybrid conjugate gradient algorithm for unconstrained optimization. Numer. Algor. 47(2), 143\u2013156 (2008)","journal-title":"Numer. Algor."},{"issue":"1","key":"2148_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16(1), 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"issue":"1","key":"2148_CR4","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. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"2148_CR5","unstructured":"Bertsekas, D.: Nonlinear programming. Athena Scientific (1999)"},{"key":"2148_CR6","volume-title":"A first course in wavelets with Fourier analysis","author":"A Boggess","year":"2015","unstructured":"Boggess, A., Narcowich, F.J.: A first course in wavelets with Fourier analysis. John Wiley & Sons, USA (2015)"},{"issue":"1","key":"2148_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"5\u20136","key":"2148_CR8","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.B., Boyd, S.P.: Enhancing sparsity by reweighted l1 minimization. J. Fourier Anal. Appl. 14(5\u20136), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"2148_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/83.661182","volume":"7","author":"A Chambolle","year":"1998","unstructured":"Chambolle, A., De Vore, R.A., Lee, N.Y., Lucier, B.J.: Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage. IEEE Trans. Image Process. 7(3), 319\u2013335 (1998)","journal-title":"IEEE Trans. Image Process."},{"key":"2148_CR10","doi-asserted-by":"crossref","unstructured":"Chan, R.H., Liang, H.X.: Half-quadratic algorithm for $$\\ell _p$$-$$\\ell _q $$ problems with applications to tv-$$\\ell _1$$ image restoration and compressive sensing. In: Efficient algorithms for global optimization methods in computer vision, pp. 78\u2013103. Springer (2014)","DOI":"10.1007\/978-3-642-54774-4_4"},{"issue":"4","key":"2148_CR11","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1137\/080740167","volume":"3","author":"X Chen","year":"2010","unstructured":"Chen, X., Zhou, W.: Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization. SIAM J. Imag. Sci. 3(4), 765\u2013790 (2010)","journal-title":"SIAM J. Imag. Sci."},{"issue":"4","key":"2148_CR12","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model Simulation 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model Simulation"},{"issue":"1","key":"2148_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2148_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1023\/A:1012930416777","volume":"103","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Yuan, Y.: An efficient hybrid conjugate gradient method for unconstrained optimization. Ann. Oper. Res. 103(1), 33\u201347 (2001)","journal-title":"Ann. Oper. Res."},{"issue":"11","key":"2148_CR15","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math.: A J. Issued Courant Inst. Math. Sci. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math.: A J. Issued Courant Inst. Math. Sci."},{"issue":"4","key":"2148_CR16","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2148_CR17","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1109\/TIP.2003.814255","volume":"12","author":"MA Figueiredo","year":"2003","unstructured":"Figueiredo, M.A., Nowak, R.D.: An EM algorithm for wavelet-based image restoration. IEEE Trans. Image Process. 12(8), 906\u2013916 (2003)","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"2148_CR18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"1","key":"2148_CR19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"JC Gilbert","year":"1992","unstructured":"Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2(1), 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"2148_CR20","doi-asserted-by":"crossref","unstructured":"Giselsson, P., Boyd, S.: Monotonicity and restart in fast gradient methods. In: 53rd IEEE Conference on Decision and Control, pp. 5058\u20135063. IEEE (2014)","DOI":"10.1109\/CDC.2014.7040179"},{"issue":"4","key":"2148_CR21","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S1064827597323415","volume":"21","author":"GH Golub","year":"1999","unstructured":"Golub, G.H., Ye, Q.: Inexact preconditioned conjugate gradient method with inner-outer iteration. SIAM J. Sci. Comput. 21(4), 1305\u20131320 (1999)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2148_CR22","doi-asserted-by":"crossref","first-page":"566","DOI":"10.4208\/eajam.060518.130618","volume":"8","author":"L Guo","year":"2018","unstructured":"Guo, L., Li, J., Liu, Y.: Stochastic collocation methods via minimisation of the transformed $$l_1$$-penalty. East Asian J. Appl. Math. 8(3), 566\u2013585 (2018)","journal-title":"East Asian J. Appl. Math."},{"issue":"1","key":"2148_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10915-020-01404-9","volume":"87","author":"W Guo","year":"2021","unstructured":"Guo, W., Lou, Y., Qin, J., Yan, M.: A novel regularization based on the error function for sparse recovery. J. Sci. Comput. 87(1), 1\u201322 (2021)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2148_CR24","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16(1), 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2148_CR25","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pacific J. Optim. 2(1), 35\u201358 (2006)","journal-title":"Pacific J. Optim."},{"key":"2148_CR26","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing. CAAM TR07-07, Rice University 43, 44 (2007)"},{"key":"2148_CR27","unstructured":"Hardt, M.: Robustness versus acceleration (2014). http:\/\/blog.mrtz.org\/2014\/08\/18\/robustness-versus-acceleration.html"},{"issue":"4","key":"2148_CR28","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1137\/S106482759731823X","volume":"20","author":"D Hermey","year":"1999","unstructured":"Hermey, D., Watson, G.A.: Fitting data with errors in all variables using the huber m-estimator. SIAM J. Sci. Comput. 20(4), 1276\u20131298 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"2148_CR29","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"2148_CR30","volume-title":"Methods of conjugate gradients for solving linear systems","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E., et al.: Methods of conjugate gradients for solving linear systems. NBS Washington, DC (1952)"},{"issue":"2","key":"2148_CR31","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10543-016-0643-8","volume":"57","author":"G Huang","year":"2017","unstructured":"Huang, G., Lanza, A., Morigi, S., Reichel, L., Sgallari, F.: Majorization-minimization generalized krylov subspace methods for $$\\ell _p$$-$$\\ell _q$$ optimization applied to image restoration. BIT Numer. Math. 57(2), 351\u2013378 (2017)","journal-title":"BIT Numer. Math."},{"issue":"2","key":"2148_CR32","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s40305-014-0069-4","volume":"3","author":"XL Huang","year":"2015","unstructured":"Huang, X.L., Shi, L., Yan, M.: Nonconvex sorted $$\\ell _1 $$ minimization for sparse approximation. J. Oper. Res. Soc. China 3(2), 207\u2013229 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"4","key":"2148_CR33","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0167-9473(87)90049-1","volume":"5","author":"PJ Huber","year":"1987","unstructured":"Huber, P.J.: The place of the l1-norm in robust estimation. Comput. Stat. Data Anal. 5(4), 255\u2013262 (1987)","journal-title":"Comput. Stat. Data Anal."},{"issue":"5","key":"2148_CR34","doi-asserted-by":"publisher","first-page":"S30","DOI":"10.1137\/140967982","volume":"37","author":"A Lanza","year":"2015","unstructured":"Lanza, A., Morigi, S., Reichel, L., Sgallari, F.: A generalized Krylov subspace method for $$\\ell _p$$-$$\\ell _q$$ minimization. SIAM J. Sci. Comput. 37(5), S30\u2013S50 (2015). https:\/\/doi.org\/10.1137\/140967982","journal-title":"SIAM J. Sci. Comput."},{"key":"2148_CR35","first-page":"379","volume":"28","author":"H Li","year":"2015","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. Adv. Neural. Inf. Process. Syst. 28, 379\u2013387 (2015)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2148_CR36","volume-title":"Mathematical characterisation of some Krylov subspace methods","author":"J Liesen","year":"2013","unstructured":"Liesen, J., Strakos, Z.: Mathematical characterisation of some Krylov subspace methods. Oxford University Press, UK (2013)"},{"issue":"5","key":"2148_CR37","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1109\/TSP.2012.2236322","volume":"61","author":"DA Lorenz","year":"2013","unstructured":"Lorenz, D.A.: Constructing test instances for basis pursuit denoising. IEEE Trans. Signal Process. 61(5), 1210\u20131214 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"2148_CR38","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2018","unstructured":"Lou, Y., Yan, M.: Fast l1\u2013l2 minimization via a proximal operator. J. Sci. Comput. 74(2), 767\u2013785 (2018)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2148_CR39","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Yin, P., He, Q., Xin, J.: Computing sparse representation in a highly coherent dictionary based on difference of $$ L_1 $$ and $$ {L_2 }$$. J. Sci. Comput. 64(1), 178\u2013196 (2015)","journal-title":"J. Sci. Comput."},{"key":"2148_CR40","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1007\/s10915-016-0169-x","volume":"68","author":"Y Lou","year":"2016","unstructured":"Lou, Y., Yin, P., Xin, J.: Point source super-resolution via non-convex l1 based methods. J. Sci. Comput. 68, 1082\u20131100 (2016)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2148_CR41","doi-asserted-by":"crossref","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 $$\\ell _p$$ regularized unconstrained nonlinear programming. Math. Program. 147(1), 277\u2013307 (2014)","journal-title":"Math. Program."},{"issue":"6A","key":"2148_CR42","first-page":"3498","volume":"37","author":"J Lv","year":"2009","unstructured":"Lv, J., Fan, Y., et al.: A unified approach to model selection and sparse recovery using regularized least squares. Ann. Stat. 37(6A), 3498\u20133528 (2009)","journal-title":"Ann. Stat."},{"issue":"16","key":"2148_CR43","doi-asserted-by":"crossref","first-page":"8646","DOI":"10.1016\/j.amc.2013.02.060","volume":"219","author":"Y Narushima","year":"2013","unstructured":"Narushima, Y.: A smoothing conjugate gradient method for solving systems of nonsmooth equations. Appl. Math. Comput. 219(16), 8646\u20138655 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2148_CR44","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2148_CR45","first-page":"356","volume":"25","author":"AS Nemirovski","year":"1985","unstructured":"Nemirovski, A.S., Nesterov, Y.E.: Optimal methods of smooth convex minimization. Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki 25(3), 356\u2013369 (1985)","journal-title":"Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki"},{"key":"2148_CR46","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate o (1\/k2). In: Soviet Mathematics Doklady, vol.\u00a027, pp. 372\u2013376 (1983)"},{"key":"2148_CR47","volume-title":"Introductory lectures on convex optimization: A basic course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: A basic course, vol. 87. Springer Science & Business Media, UK (2003)"},{"key":"2148_CR48","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical optimization. Springer Science & Business Media, UK (2006)"},{"issue":"1","key":"2148_CR49","doi-asserted-by":"crossref","first-page":"40","DOI":"10.2306\/scienceasia1513-1874.2016.42.040","volume":"42","author":"D Pang","year":"2016","unstructured":"Pang, D., Du, S., Ju, J.: The smoothing fletcher-reeves conjugate gradient method for solving finite minimax problems. ScienceAsia 42(1), 40\u201345 (2016)","journal-title":"ScienceAsia"},{"issue":"3","key":"2148_CR50","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Opt. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Opt."},{"issue":"2","key":"2148_CR51","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham-Dinh","year":"1998","unstructured":"Pham-Dinh, T., Le-Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"2148_CR52","first-page":"23","volume":"133","author":"T Pham-Dinh","year":"2005","unstructured":"Pham-Dinh, T., Le-Thi, H.A.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals Oper. Res. 133(1\u20134), 23\u201346 (2005)","journal-title":"Annals Oper. Res."},{"issue":"R1","key":"2148_CR53","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribiere, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. ESAIM Math. Model. Numer. Anal-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique 3(R1), 35\u201343 (1969)","journal-title":"ESAIM Math. Model. Numer. Anal-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique"},{"issue":"5","key":"2148_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"B Polyak","year":"1964","unstructured":"Polyak, B.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"2148_CR55","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell, M.J.D.: Restart procedures for the conjugate gradient method. Math. Program. 12(1), 241\u2013254 (1977)","journal-title":"Math. Program."},{"issue":"6","key":"2148_CR56","doi-asserted-by":"crossref","first-page":"A3649","DOI":"10.1137\/18M123147X","volume":"41","author":"Y Rahimi","year":"2019","unstructured":"Rahimi, Y., Wang, C., Dong, H., Lou, Y.: A scale invariant approach for sparse signal recovery. SIAM J. Sci. Comput. 41(6), A3649\u2013A3672 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"2148_CR57","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1016\/j.amc.2015.07.019","volume":"268","author":"M Rivaie","year":"2015","unstructured":"Rivaie, M., Mamat, M., Abashar, A.: A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches. Appl. Math. Comput. 268, 1152\u20131163 (2015)","journal-title":"Appl. Math. Comput."},{"key":"2148_CR58","volume-title":"Variational analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational analysis, vol. 317. Springer Science & Business Media, UK (2009)"},{"issue":"1","key":"2148_CR59","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/18M1224568","volume":"30","author":"V Roulet","year":"2020","unstructured":"Roulet, V., d\u2019Aspremont, A.: Sharpness, restart, and acceleration. SIAM J. Optim. 30(1), 262\u2013289 (2020)","journal-title":"SIAM J. Optim."},{"key":"2148_CR60","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative methods for sparse linear systems. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"issue":"497","key":"2148_CR61","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1080\/01621459.2011.645783","volume":"107","author":"X Shen","year":"2012","unstructured":"Shen, X., Pan, W., Zhu, Y.: Likelihood-based selection and sharp parameter estimation. J. Am. Stat. Assoc. 107(497), 223\u2013232 (2012)","journal-title":"J. Am. Stat. Assoc."},{"key":"2148_CR62","first-page":"2510","volume":"27","author":"W Su","year":"2014","unstructured":"Su, W., Boyd, S., Candes, E.: A differential equation for modeling nesterov\u2019s accelerated gradient method: Theory and insights. Adv. Neural. Inf. Process. Syst. 27, 2510\u20132518 (2014)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"529","key":"2148_CR63","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1080\/01621459.2018.1543124","volume":"115","author":"Q Sun","year":"2020","unstructured":"Sun, Q., Zhou, W.X., Fan, J.: Adaptive huber regression. J. Am. Stat. Assoc. 115(529), 254\u2013265 (2020)","journal-title":"J. Am. Stat. Assoc."},{"issue":"232","key":"2148_CR64","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1090\/S0025-5718-99-01171-0","volume":"69","author":"C Tong","year":"2000","unstructured":"Tong, C., Ye, Q.: Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems. Math. Comput. 69(232), 1559\u20131575 (2000)","journal-title":"Math. Comput."},{"key":"2148_CR65","doi-asserted-by":"crossref","unstructured":"Unser, M.: Sampling $$-$$ 50 years after shannon. In: Proceedings of the IEEE, pp. 569 \u2013 587. IEEE (2000)","DOI":"10.1109\/5.843002"},{"key":"2148_CR66","doi-asserted-by":"crossref","unstructured":"Vonesch, C., Unser, M.: A fast iterative thresholding algorithm for wavelet-regularized deconvolution. In: Wavelets XII, vol. 6701, p. 67010D. International Society for Optics and Photonics (2007)","DOI":"10.1117\/12.733532"},{"key":"2148_CR67","doi-asserted-by":"crossref","first-page":"2660","DOI":"10.1109\/TSP.2020.2985298","volume":"68","author":"C Wang","year":"2020","unstructured":"Wang, C., Yan, M., Rahimi, Y., Lou, Y.: Accelerated schemes for the $$ {L}_1\/{L}_2 $$ minimization. IEEE Trans. Signal Process. 68, 2660\u20132669 (2020)","journal-title":"IEEE Trans. Signal Process."},{"key":"2148_CR68","first-page":"420","volume-title":"Subspace iteration and simultaneous iteration","author":"DS Watkins","year":"2010","unstructured":"Watkins, D.S.: Subspace iteration and simultaneous iteration, pp. 420\u2013428. John Wiley & Sons, UK (2010)"},{"issue":"7","key":"2148_CR69","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.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":"4","key":"2148_CR70","first-page":"1","volume":"56","author":"C Wu","year":"2019","unstructured":"Wu, C., Zhan, J., Lu, Y., Chen, J.S.: Signal reconstruction by conjugate gradient algorithm based on smoothing l1-norm. Calcolo 56(4), 1\u201326 (2019)","journal-title":"Calcolo"},{"issue":"2","key":"2148_CR71","doi-asserted-by":"crossref","first-page":"87","DOI":"10.4310\/CIS.2014.v14.n2.a2","volume":"14","author":"P Yin","year":"2014","unstructured":"Yin, P., Esser, E., Xin, J.: Ratio and difference of $$l_1$$ and $$l_2$$ norms and sparse representation with coherent dictionaries. Comm. Inf. Syst. 14(2), 87\u2013109 (2014)","journal-title":"Comm. Inf. Syst."},{"issue":"1","key":"2148_CR72","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 $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"2148_CR73","doi-asserted-by":"crossref","first-page":"511","DOI":"10.4310\/CMS.2017.v15.n2.a9","volume":"15","author":"S Zhang","year":"2017","unstructured":"Zhang, S., Xin, J.: Minimization of transformed $${L_1}$$ penalty: closed form representation and iterative thresholding algorithms. Comm. Math. Sci. 15, 511\u2013537 (2017)","journal-title":"Comm. Math. Sci."},{"issue":"1","key":"2148_CR74","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-018-1236-x","volume":"169","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Xin, J.: Minimization of transformed $${L_1 }$$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing. Math. Program. 169(1), 307\u2013336 (2018)","journal-title":"Math. Program."},{"key":"2148_CR75","unstructured":"Zhang, T.: Multi-stage convex relaxation for learning with sparse regularization. In: Adv. Neural Inf. Proces. Syst. (NIPS), pp. 1929\u20131936 (2009)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02148-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02148-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02148-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T13:51:57Z","timestamp":1702043517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02148-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,8]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2148"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02148-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,8]]},"assertion":[{"value":"22 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"33"}}