{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T03:16:46Z","timestamp":1771125406871,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T00:00:00Z","timestamp":1601856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T00:00:00Z","timestamp":1601856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10898-020-00955-3","type":"journal-article","created":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T02:02:36Z","timestamp":1601863356000},"page":"853-883","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems"],"prefix":"10.1007","volume":"79","author":[{"given":"Yaohua","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4333-0184","authenticated-orcid":false,"given":"Kaiwen","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,5]]},"reference":[{"key":"955_CR1","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\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"955_CR2","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\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"955_CR3","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1214\/12-STS394","volume":"27","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Structured sparsity through convex optimization. Stat. Sci. 27, 450\u2013468 (2012)","journal-title":"Stat. Sci."},{"key":"955_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. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"955_CR5","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Cambridge (1999)"},{"key":"955_CR6","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.E.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14, 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"955_CR7","first-page":"1","volume":"2016","author":"J Bolte","year":"2016","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 2016, 1\u201337 (2016)","journal-title":"Math. Program."},{"key":"955_CR8","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2013","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2013)","journal-title":"Math. Program."},{"key":"955_CR9","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1007\/s00041-008-9041-1","volume":"14","author":"K Bredies","year":"2008","unstructured":"Bredies, K., Lorenz, D.A.: Linear convergence of iterative soft-thresholding. J. Fourier Anal. Appl. 14, 813\u2013837 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"955_CR10","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/s10957-014-0614-7","volume":"165","author":"K Bredies","year":"2015","unstructured":"Bredies, K., Lorenz, D.A., Reiterer, S.: Minimization of non-smooth, non-convex functionals by iterative thresholding. J. Optim. Theory App. 165, 78\u2013112 (2015)","journal-title":"J. Optim. Theory App."},{"key":"955_CR11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/050647621","volume":"18","author":"RS Burachik","year":"2007","unstructured":"Burachik, R.S., Rubinov, A.: Abstract convexity and augmented Lagrangians. SIAM J. Optim. 18, 413\u2013436 (2007)","journal-title":"SIAM J. Optim."},{"key":"955_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-015-0941-y","volume":"157","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Nocedal, J., Oztoprak, F.: An inexact successive quadratic approximation method for $$L-1$$ regularized optimization. Math. Program. 157, 375\u2013396 (2016)","journal-title":"Math. Program."},{"key":"955_CR13","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inform. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"955_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.jvcir.2012.10.006","volume":"24","author":"W Cao","year":"2013","unstructured":"Cao, W., Sun, J., Xu, Z.: Fast image deconvolution using closed-form thresholding formulas of $$L_q$$$$(q=\\frac{1}{2},\\frac{2}{3})$$ regularization. J. Vis. Commun. Image R. 24, 31\u201341 (2013)","journal-title":"J. Vis. Commun. Image R."},{"key":"955_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1088\/0266-5611\/24\/3\/035020","volume":"24","author":"R Chartrand","year":"2008","unstructured":"Chartrand, R., Staneva, V.: Restricted isometry properties and nonconvex compressive sensing. Inverse Probl. 24, 1\u201314 (2008)","journal-title":"Inverse Probl."},{"key":"955_CR16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134, 71\u201399 (2012)","journal-title":"Math. Program."},{"key":"955_CR17","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen, X., Xu, F., Ye, Y.: Lower bound theory of nonzero entries in solutions of $$\\ell _2$$\u2013$$\\ell _p$$ minimization. SIAM J. Sci. Comput. 32, 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"955_CR18","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\u2013backward splitting. Multiscale Model. Sim. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Sim."},{"key":"955_CR19","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. Pur. Appl. Math. 57, 1413\u20131457 (2004)","journal-title":"Commun. Pur. Appl. Math."},{"key":"955_CR20","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. Inform. Theory 52, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"955_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and Redundant Representations","author":"M Elad","year":"2010","unstructured":"Elad, M.: Sparse and Redundant Representations. Springer, New York (2010)"},{"key":"955_CR22","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka\u2013Lojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165, 874\u2013900 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"955_CR23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10107-011-0470-2","volume":"129","author":"D Ge","year":"2011","unstructured":"Ge, D., Jiang, X., Ye, Y.: A note on complexity of $$L_p$$ minimization. Mathm. Program. 129, 285\u2013299 (2011)","journal-title":"Mathm. Program."},{"key":"955_CR24","first-page":"1","volume":"18","author":"Y Hu","year":"2017","unstructured":"Hu, Y., Li, C., Meng, K., Qin, J., Yang, X.: Group sparse optimizatin via $$\\ell _{p, q}$$ regularization. J. Mach. Learn. Res 18, 1\u201352 (2017)","journal-title":"J. Mach. Learn. Res"},{"key":"955_CR25","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1137\/140993090","volume":"26","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Li, C., Yang, X.: On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM J. Optim. 26, 1207\u20131235 (2016)","journal-title":"SIAM J. Optim."},{"key":"955_CR26","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1287\/moor.28.3.533.16395","volume":"28","author":"X Huang","year":"2003","unstructured":"Huang, X., Yang, X.: A unified augmented Lagrangian approach to duality and exact penalization. Math. Oper. Res. 28, 533\u2013552 (2003)","journal-title":"Math. Oper. Res."},{"key":"955_CR27","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"M Lai","year":"2011","unstructured":"Lai, M., Wang, J.: An unconstrained $$\\ell _q$$ minimization with $$0< q \\le 1$$ for sparse solution of underdetermined linear systems. SIAM J. Optim. 21, 82\u2013101 (2011)","journal-title":"SIAM J. Optim."},{"key":"955_CR28","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24, 1420\u20131443 (2014)","journal-title":"SIAM J. Optim."},{"key":"955_CR29","first-page":"1","volume":"159","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Douglas\u2013Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159, 1\u201331 (2015)","journal-title":"Math. Program."},{"key":"955_CR30","doi-asserted-by":"crossref","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25, 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"key":"955_CR31","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s10589-017-9933-6","volume":"68","author":"Z Lu","year":"2017","unstructured":"Lu, Z., Zhang, Y., Lu, J.: $$\\ell _p$$ Regularized low-rank approximation via iterative reweighted singular value minimization. Comput. Optim. Appl. 68, 619\u2013642 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"955_CR32","doi-asserted-by":"crossref","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23, 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"key":"955_CR33","doi-asserted-by":"crossref","first-page":"064001","DOI":"10.1088\/1361-6420\/ab08de","volume":"35","author":"J Lu","year":"2019","unstructured":"Lu, J., Qiao, K., Li, X., Zou, Y., Lu, Z.: $$\\ell _0$$-minimization methods for image restoration problems based on wavelet frames. Inverse Probl. 35, 064001 (2019)","journal-title":"Inverse Probl."},{"key":"955_CR34","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"Z Luo","year":"1996","unstructured":"Luo, Z., Pang, J., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"key":"955_CR35","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J.: Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J. Optim. 25, 829\u2013855 (2015)","journal-title":"SIAM J. Optim."},{"key":"955_CR36","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1109\/TSP.2014.2303429","volume":"62","author":"G Marjanovic","year":"2014","unstructured":"Marjanovic, G., Solo, V.: On $$l_q$$ optimization and sparse inverse covariance selection. IEEE Trans. Sig. Proc. 62, 1644\u20131654 (2014)","journal-title":"IEEE Trans. Sig. Proc."},{"key":"955_CR37","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. Program. 140, 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"955_CR38","doi-asserted-by":"crossref","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 nonconvex optimization. SIAM J. Imaging Sci. 7, 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"955_CR39","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1137\/11085476X","volume":"6","author":"M Nikolova","year":"2013","unstructured":"Nikolova, M.: Description of the minimizers of least squares regularized with $$\\ell _0$$-norm. Uniqueness of the global minimizer. SIAM J. Imaging Sci. 6, 904\u2013937 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"955_CR40","first-page":"198","volume":"61","author":"JK Pant","year":"2014","unstructured":"Pant, J.K., Lu, W.S., Antoniou, A.: New improved algorithms for compressive sensing based on $$\\ell _{p}$$ norm. IEEE Trans. Circuits II 61, 198\u2013202 (2014)","journal-title":"IEEE Trans. Circuits II"},{"key":"955_CR41","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.ymeth.2014.03.006","volume":"67","author":"J Qin","year":"2014","unstructured":"Qin, J., Hu, Y.H., Xu, F., Yalamanchili, H.K., Wang, J.: Inferring gene regulatory networks by integrating ChIP-seq\/chip and transcriptome data via LASSO-type regularization methods. Methods 67, 294\u2013303 (2014)","journal-title":"Methods"},{"key":"955_CR42","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23, 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"key":"955_CR43","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"955_CR44","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":"955_CR45","first-page":"1458","volume":"24","author":"M Schmidt","year":"2011","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. Adv. Neural Inf. Process. Syst. 24, 1458\u20131466 (2011)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"955_CR46","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/10618600.2012.681250","volume":"22","author":"N Simon","year":"2013","unstructured":"Simon, N., Friedman, J., Hastie, T., Tibshirani, R.: A sparse-group Lasso. J. Comput. Graph. Stat. 22, 231\u2013245 (2013)","journal-title":"J. Comput. Graph. Stat."},{"key":"955_CR47","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/151004549","volume":"26","author":"S Tao","year":"2016","unstructured":"Tao, S., Boley, D., Zhang, S.: Local linear convergence of ISTA and FISTA on the LASSO problem. SIAM J. Optim. 26, 313\u2013336 (2016)","journal-title":"SIAM J. Optim."},{"key":"955_CR48","doi-asserted-by":"crossref","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":"955_CR49","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"955_CR50","doi-asserted-by":"crossref","first-page":"055017","DOI":"10.1088\/1361-6420\/aa6699","volume":"33","author":"J Wang","year":"2017","unstructured":"Wang, J., Hu, Y., Li, C., Yao, J.-C.: Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Probl. 33, 055017 (2017)","journal-title":"Inverse Probl."},{"key":"955_CR51","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1137\/15M1051257","volume":"26","author":"J Wang","year":"2017","unstructured":"Wang, J., Li, C., Lopez, G., Yao, J.-C.: Proximal point algorithms on Hadamard manifolds: linear convergence and finite termination. SIAM J. Optim. 26, 2696\u20132729 (2017)","journal-title":"SIAM J. Optim."},{"key":"955_CR52","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27, 124\u2013145 (2017)","journal-title":"SIAM J. Optim."},{"key":"955_CR53","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1137\/120869997","volume":"23","author":"L Xiao","year":"2013","unstructured":"Xiao, L., Zhang, T.: A proximal-gradient homotopy method for the sparse least-squares problem. SIAM J. Optim. 23, 1062\u20131091 (2013)","journal-title":"SIAM J. Optim."},{"key":"955_CR54","doi-asserted-by":"crossref","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":"955_CR55","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $${L}_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neur. Net. Lear. 23, 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neur. Net. Lear."},{"key":"955_CR56","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\ell _1$$-problems in compressive sensing. SIAM J. Sci. Comput. 33, 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"955_CR57","doi-asserted-by":"crossref","first-page":"5106","DOI":"10.1109\/TSP.2016.2595499","volume":"64","author":"J Zeng","year":"2016","unstructured":"Zeng, J., Lin, S., Xu, Z.: Sparse regularization: convergence of iterative jumping thresholding algorithm. IEEE Trans. Sig. Proc. 64, 5106\u20135118 (2016)","journal-title":"IEEE Trans. Sig. Proc."},{"key":"955_CR58","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s40305-013-0015-x","volume":"1","author":"H Zhang","year":"2013","unstructured":"Zhang, H., Jiang, J., Luo, Z.-Q.: On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems. J. Oper. Res. Soc. China 1, 163\u2013186 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"key":"955_CR59","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1080\/02331934.2017.1318133","volume":"66","author":"L Zhang","year":"2017","unstructured":"Zhang, L., Hu, Y., Li, C., Yao, J.-C.: A new linear convergence result for the iterative soft thresholding algorithm. Optimization 66, 1177\u20131189 (2017)","journal-title":"Optimization"},{"key":"955_CR60","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1080\/02331934.2018.1470629","volume":"67","author":"L Zhang","year":"2018","unstructured":"Zhang, L., Hu, Y., Yu, C.K.W., Wang, J.: Iterative positive thresholding algorithm for nonnegative sparse optimization. Optimization 67, 1345\u20131363 (2018)","journal-title":"Optimization"},{"key":"955_CR61","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, 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00955-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00955-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00955-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T14:36:11Z","timestamp":1633444571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00955-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,5]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["955"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00955-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,5]]},"assertion":[{"value":"22 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}