{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T07:02:45Z","timestamp":1756191765619,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T00:00:00Z","timestamp":1599782400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T00:00:00Z","timestamp":1599782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61967004"],"award-info":[{"award-number":["61967004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s40314-020-01313-5","type":"journal-article","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T18:02:45Z","timestamp":1599847365000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery"],"prefix":"10.1007","volume":"39","author":[{"given":"Zhibin","family":"Zhu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6833-4910","authenticated-orcid":false,"given":"Jinyao","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Benxin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,11]]},"reference":[{"issue":"1","key":"1313_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1093\/imanum\/5.1.121","volume":"5","author":"M Al-Baali","year":"1985","unstructured":"Al-Baali M (1985) Descent property and global convergence of the Fletcher\u2013Reeves method with inexact line search. IMA J Numer Anal 5(1):121\u2013124","journal-title":"IMA J Numer Anal"},{"issue":"2","key":"1313_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10957-008-9505-0","volume":"141","author":"N Andrei","year":"2009","unstructured":"Andrei N (2009) Hybrid conjugate gradient algorithm for unconstrained optimization. J Optim Theory App 141(2):249\u2013264","journal-title":"J Optim Theory App"},{"issue":"3","key":"1313_CR3","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck A, Eldar YC (2013) Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J Optim 23(3):1480\u20131509","journal-title":"SIAM J Optim"},{"issue":"4","key":"1313_CR4","first-page":"289","volume":"4","author":"JD Blanchard","year":"2015","unstructured":"Blanchard JD, Jared T, Ke W (2015) CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion[J]. Inf Infer J IMA 4(4):289\u2013327","journal-title":"Inf Infer J IMA"},{"issue":"281","key":"1313_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1090\/S0025-5718-2012-02599-3","volume":"82","author":"M Burger","year":"2013","unstructured":"Burger M, M\u00f6ller M, Benning M et al (2013) An adaptive inverse scale space method for compressed sensing. Math Comput 82(281):269\u2013299","journal-title":"Math Comput"},{"key":"1313_CR6","doi-asserted-by":"crossref","unstructured":"Chen J, Gu Q (2017) Fast newton hard thresholding pursuit for sparsity constrained nonconvex optimization. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 757\u2013766","DOI":"10.1145\/3097983.3098165"},{"issue":"5","key":"1313_CR7","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai W, Milenkovic O (2009) Subspace pursuit for compressive sensing signal reconstruction. IEEE T Inform Theory 55(5):2230\u20132249","journal-title":"IEEE T Inform Theory"},{"issue":"1\u20134","key":"1313_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1012930416777","volume":"103","author":"Y Dai","year":"2001","unstructured":"Dai Y, Yuan Y (2001) An efficient hybrid conjugate gradient method for unconstrained optimization. Ann Oper Res 103(1\u20134):33\u201347","journal-title":"Ann Oper Res"},{"issue":"5","key":"1313_CR9","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1411509.1411512","volume":"55","author":"NR Devanur","year":"2008","unstructured":"Devanur NR, Papadimitriou CH, Saberi A et al (2008) Market equilibrium via a primal-dual algorithm for a convex program. J ACM 55(5):22","journal-title":"J ACM"},{"issue":"1","key":"1313_CR10","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TIT.2009.2034789","volume":"56","author":"YC Eldar","year":"2009","unstructured":"Eldar YC, Rauhut H (2009) Average case analysis of multichannel sparse recovery using convex relaxation. IEEE T Inform Theory 56(1):505\u2013519","journal-title":"IEEE T Inform Theory"},{"issue":"1","key":"1313_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.acha.2009.10.004","volume":"29","author":"S Foucart","year":"2010","unstructured":"Foucart S (2010) A note on guaranteed sparse recovery via $$l_1$$-minimization. Appl Comput Harmon A 29(1):97\u2013103","journal-title":"Appl Comput Harmon A"},{"issue":"6","key":"1313_CR12","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart S (2011) Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J Numer Anal 49(6):2543\u20132563","journal-title":"SIAM J Numer Anal"},{"key":"1313_CR13","first-page":"151","volume":"54","author":"S Foucart","year":"2017","unstructured":"Foucart S, Rauhut H (2017) A mathematical introduction to compressive sensing. Bull Am Math 54:151\u2013165","journal-title":"Bull Am Math"},{"issue":"4","key":"1313_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jvcir.2010.02.007","volume":"21","author":"B Han","year":"2010","unstructured":"Han B, Wu F, Wu D (2010) Image representation by compressive sensing for visual sensor networks. J Vis Commun Image R 21(4):325\u2013333","journal-title":"J Vis Commun Image R"},{"issue":"6","key":"1313_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.3788\/GXJS20144006.0515","volume":"40","author":"H Huang","year":"2014","unstructured":"Huang H, Zhuang S (2014) Image fast reconstruction algorithm based on improved orthogonal matching pursuit. Opt Tech 40(6):515\u2013519","journal-title":"Opt Tech"},{"issue":"5","key":"1313_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s12209-016-2870-0","volume":"22","author":"Q Liu","year":"2016","unstructured":"Liu Q, Sang R, Zhang Q (2016) FPGA-based acceleration of Davidon\u2013Fletcher\u2013Powell quasi-Newton optimization method. Trans Tian Univer 22(5):381\u2013387","journal-title":"Trans Tian Univer"},{"key":"1313_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.apnum.2019.06.003","volume":"145","author":"P Mtagulwa","year":"2019","unstructured":"Mtagulwa P, Kaelo P (2019) An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems. Appl Numer Math 145:111\u2013120","journal-title":"Appl Numer Math"},{"issue":"5","key":"1313_CR18","doi-asserted-by":"publisher","first-page":"2210","DOI":"10.1109\/TIT.2008.920190","volume":"54","author":"H Rauhut","year":"2008","unstructured":"Rauhut H, Schnass K, Vandergheynst P (2008) Compressed sensing and redundant dictionaries. IEEE T Inform Theory 54(5):2210\u20132219","journal-title":"IEEE T Inform Theory"},{"issue":"1","key":"1313_CR19","first-page":"7650","volume":"18","author":"J Shen","year":"2017","unstructured":"Shen J, Li P (2017) A tight bound of hard thresholding. J Mach Learn Res 18(1):7650\u20137691","journal-title":"J Mach Learn Res"},{"issue":"6","key":"1313_CR20","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.1016\/j.na.2006.02.001","volume":"66","author":"ZJ Shi","year":"2007","unstructured":"Shi ZJ, Shen J (2007) Convergence of the Polak\u2013Ribire\u2013Polyak conjugate gradient method. Nonlinear Anal Theory Methods Appl 66(6):1428\u20131441","journal-title":"Nonlinear Anal Theory Methods Appl"},{"issue":"4","key":"1313_CR21","first-page":"2883","volume":"7","author":"G Sun","year":"2012","unstructured":"Sun G, Zhou Y, Wang Z et al (2012) Sparsity adaptive compressive sampling matching pursuit algorithm based on compressive sensing. J Comput Infom Syst 7(4):2883\u20132890","journal-title":"J Comput Infom Syst"},{"issue":"10","key":"1313_CR22","doi-asserted-by":"publisher","first-page":"2082","DOI":"10.1080\/00207160.2017.1366457","volume":"95","author":"Z Sun","year":"2018","unstructured":"Sun Z, Li H, Wang J et al (2018) Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization. Int J Comput Math 95(10):2082\u20132099","journal-title":"Int J Comput Math"},{"issue":"8","key":"1313_CR23","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1016\/j.jvcir.2014.09.001","volume":"25","author":"MS Wu","year":"2014","unstructured":"Wu MS (2014) Genetic algorithm based on discrete wavelet transformation for fractal image compression. J Vis Commun Image R. 25(8):1835\u20131841","journal-title":"J Vis Commun Image R."},{"issue":"2","key":"1313_CR24","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.amc.2007.02.094","volume":"191","author":"SW Yao","year":"2007","unstructured":"Yao SW, Wei ZX, Huang H (2007) A note about WYLs conjugate gradient method and its applications. Appl Math comput 191(2):381\u2013388","journal-title":"Appl Math comput"},{"issue":"1","key":"1313_CR25","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/TCSI.2002.807513","volume":"50","author":"K Yamamura","year":"2003","unstructured":"Yamamura K, Kaneko R (2003) Finding all solutions of piecewise-linear resistive circuits using the simplex method. IEEE T Circuits I F Theory Appl 50(1):160\u2013165","journal-title":"IEEE T Circuits I F Theory Appl"},{"key":"1313_CR26","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.cam.2018.10.057","volume":"362","author":"G Yuan","year":"2019","unstructured":"Yuan G, Wei Z, Yang Y (2019) The global convergence of the Polak\u2013Ribiere\u2013Polyak conjugate gradient algorithm under inexact line search for nonconvex functions[J]. J Comput Appl Math 362:262\u2013275","journal-title":"J Comput Appl Math"},{"key":"1313_CR27","doi-asserted-by":"crossref","unstructured":"Zhang X, Zhang XQ (2015) A Note on the complexity of proximal iterative hard thresholding algorithm. J Oper Res Soc Chin 3(4):459\u2013473","DOI":"10.1007\/s40305-015-0105-z"},{"issue":"13","key":"1313_CR28","first-page":"1","volume":"76","author":"YJ Zhang","year":"2016","unstructured":"Zhang YJ, Qi R, Zeng YN (2016) Backtracking-based matching pursuit method for distributed compressed sensing. Multimed Tools Appl 76(13):1\u201320","journal-title":"Multimed Tools Appl"},{"key":"1313_CR29","first-page":"121","volume":"14","author":"G Zhai","year":"1996","unstructured":"Zhai G, Ikeda M, Fujisaki Y (1996) Decentralized H-infinity control for large-scale systems: a matrix inequality approach using a homotopy method. Mem G School Sci Technol 14:121\u2013132","journal-title":"Mem G School Sci Technol"},{"issue":"6","key":"1313_CR30","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1016\/j.amc.2009.08.016","volume":"215","author":"L Zhang","year":"2009","unstructured":"Zhang L (2009) An improved Wei\u2013Yao\u2013Liu nonlinear conjugate gradient method for optimization computation. Appl Math Comput 215(6):2269\u20132274","journal-title":"Appl Math Comput"},{"issue":"5","key":"1313_CR31","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.orl.2011.06.006","volume":"39","author":"L Zhang","year":"2011","unstructured":"Zhang L, Xu Y (2011) A full-Newton step interior-point algorithm based on modified Newton direction. Oper Res Lett 39(5):318\u2013322","journal-title":"Oper Res Lett"},{"issue":"2","key":"1313_CR32","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jvcir.2012.05.006","volume":"24","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Shi Y, Ding W et al (2013) MR images reconstruction based on TVWL2-L1 model. J Vis Commu Image R 24(2):187\u2013195","journal-title":"J Vis Commu Image R"},{"issue":"2","key":"1313_CR33","doi-asserted-by":"publisher","first-page":"36","DOI":"10.3390\/a12020036","volume":"12","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Huang Y, Li H et al (2019) Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery. Algorithms 12(2):36","journal-title":"Algorithms"},{"key":"1313_CR34","doi-asserted-by":"crossref","unstructured":"Zhao R, Jiao B (2012) A Modified DY conjugate gradient algorithm with sufficient descent. In: 2012 Fifth I Joint Confer Comput Sci Opt. IEEE 209\u2013212:","DOI":"10.1109\/CSO.2012.53"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01313-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01313-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01313-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T17:51:58Z","timestamp":1723571518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01313-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,11]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1313"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01313-5","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2020,9,11]]},"assertion":[{"value":"25 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"270"}}