{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T23:45:01Z","timestamp":1777938301769,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T00:00:00Z","timestamp":1509926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61563009"],"award-info":[{"award-number":["61563009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004001","name":"Science and Technology Foundation of Guizhou Province","doi-asserted-by":"crossref","award":["LKQS201314"],"award-info":[{"award-number":["LKQS201314"]}],"id":[{"id":"10.13039\/501100004001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00521-017-3239-6","type":"journal-article","created":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T14:57:53Z","timestamp":1509980273000},"page":"2905-2920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["KKT condition-based smoothing recurrent neural network for nonsmooth nonconvex optimization in compressed sensing"],"prefix":"10.1007","volume":"31","author":[{"given":"Dan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,6]]},"reference":[{"issue":"4","key":"3239_CR1","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho DL (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289\u20131306","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"3239_CR2","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Candes","year":"2006","unstructured":"Candes EJ, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inf Theory 52(2):489\u2013509","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"3239_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan BK (1995) Sparse approximate solutions to linear systems. SIAM J Comput 24(2):227\u2013234","journal-title":"SIAM J Comput"},{"issue":"1","key":"3239_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen SS, Donoho DL, Saunders MA (2001) Atomic decomposition by basis pursuit. SIAM Rev 43(1):129\u2013159","journal-title":"SIAM Rev"},{"issue":"12","key":"3239_CR5","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso G, Rakotomamonjy A, Canu S (2009) Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Trans Signal Process 57(12):4686\u20134698","journal-title":"IEEE Trans Signal Process"},{"issue":"3","key":"3239_CR6","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 MJ (2009) Sparsest solutions of underdetermined linear systems via $$l_q$$ l q -minimization for $$0<q\\le 1$$ 0 < q \u2264 1 . Appl Comput Harmon Anal 26(3):395\u2013407","journal-title":"Appl Comput Harmon Anal"},{"issue":"2","key":"3239_CR7","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai MJ, Xu Y, Yin W (2013) Improved iteratively reweighted least squares for unconstrained smoothed $$l_q$$ l q minimization. SIAM J Numer Anal 51(2):927\u2013957","journal-title":"SIAM J Numer Anal"},{"issue":"7","key":"3239_CR8","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1109\/83.392335","volume":"4","author":"D Geman","year":"1995","unstructured":"Geman D, Yang C (1995) Nonlinear image recovery with half-quadratic regularization. IEEE Trans Image Process 4(7):932\u2013946","journal-title":"IEEE Trans Image Process"},{"issue":"11","key":"3239_CR9","doi-asserted-by":"publisher","first-page":"4347","DOI":"10.1109\/TSP.2009.2025979","volume":"57","author":"J Trzasko","year":"2009","unstructured":"Trzasko J, Manduca A (2009) Relaxed conditions for sparse signal recovery with general concave priors. IEEE Trans Signal Process 57(11):4347\u20134354","journal-title":"IEEE Trans Signal Process"},{"issue":"456","key":"3239_CR10","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan J, Li R (2001) Variable selection via nonconcave penalized likelihood and its oracle properties. J Amer Stat Assoc 96(456):1348\u20131360","journal-title":"J Amer Stat Assoc"},{"issue":"3","key":"3239_CR11","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.ijforecast.2012.05.001","volume":"28","author":"JH Friedman","year":"2012","unstructured":"Friedman JH (2012) Fast sparse regression and classification. Int J Forecast 28(3):722\u2013738","journal-title":"Int J Forecast"},{"issue":"2","key":"3239_CR12","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang CH (2010) Nearly unbiased variable selection under minimax concave penalty. Ann Stat 38(2):894\u2013942","journal-title":"Ann Stat"},{"key":"3239_CR13","doi-asserted-by":"crossref","unstructured":"Zhang S, Qian H, Chen W, Zhang Z (2013) A concave conjugate approach for nonconvex penalized regression with the MCP penalty. In: Proceedings of the 27th AAAI conference on artificial intelligence 2013, pp 1027\u20131033","DOI":"10.1609\/aaai.v27i1.8605"},{"issue":"2","key":"3239_CR14","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang T (2010) Analysis of multi-stage convex relaxation for sparse regularization. J Mach Learn Res 11(2):1081\u20131107","journal-title":"J Mach Learn Res"},{"key":"3239_CR15","doi-asserted-by":"crossref","unstructured":"Gao C, Wang N, Yu Q, Zhang Z (2011) A feasible nonconvex relaxation approach to feature selection. In: Proceedings of the 25th AAAI conference on artificial intelligence 2011, pp 356\u2013361","DOI":"10.1609\/aaai.v25i1.7921"},{"issue":"3","key":"3239_CR16","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/151003714","volume":"8","author":"E Soubies","year":"2015","unstructured":"Soubies E, Blanc-Fraud L, Aubert G (2015) A continuous exact $$L_0$$ L 0 penalty (CEL0) for least squares regularized problem. SIAM J Imaging Sci 8(3):1607\u20131639","journal-title":"SIAM J Imaging Sci"},{"issue":"21","key":"3239_CR17","doi-asserted-by":"publisher","first-page":"5657","DOI":"10.1109\/TSP.2016.2585096","volume":"64","author":"M Malek-Mohammadi","year":"2016","unstructured":"Malek-Mohammadi M, Koochakzadeh A, Babaie-Zadeh M, Jansson M, Rojas CR (2016) Successive concave sparsity approximation for compressed sensing. IEEE Trans Signal Process 64(21):5657\u20135671","journal-title":"IEEE Trans Signal Process"},{"issue":"5","key":"3239_CR18","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1109\/TSP.2014.2298839","volume":"62","author":"IW Selesnick","year":"2014","unstructured":"Selesnick IW, Bayram I (2014) Sparse signal estimation by maximally sparse convex optimization. IEEE Trans Signal Process 62(5):1078\u20131092","journal-title":"IEEE Trans Signal Process"},{"key":"3239_CR19","doi-asserted-by":"crossref","unstructured":"Lou Y, Osher S, Xin J (2015) Computational aspects of constrained $$L_1-L_2$$ L 1 - L 2 minimization for compressive sensing. Modelling. Springer, Computation and optimization in information systems and management sciences, pp 169\u2013180","DOI":"10.1007\/978-3-319-18161-5_15"},{"issue":"1","key":"3239_CR20","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin P, Lou Y, He Q, Xin J (2015) Minimization of $$l_{1-2}$$ l 1 - 2 for compressed sensing. SIAM J Sci Comput 37(1):A536\u2013A563","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"3239_CR21","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1109\/TII.2016.2601521","volume":"13","author":"H Zhang","year":"2017","unstructured":"Zhang H, Li J, Ji Y, Yue H (2017) Understanding subtitles by character-level sequence-to-sequence learning. IEEE Trans Ind Inform 13(2):616\u2013624","journal-title":"IEEE Trans Ind Inform"},{"key":"3239_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.neunet.2014.09.003","volume":"61","author":"J Schmidhuber","year":"2015","unstructured":"Schmidhuber J (2015) Deep learning in neural networks: an overview. Neural Netw 61:85\u2013117","journal-title":"Neural Netw"},{"issue":"3","key":"3239_CR23","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TNNLS.2013.2278427","volume":"25","author":"W Bian","year":"2014","unstructured":"Bian W, Chen X (2014) Neural network for nonsmooth, nonconvex constrained minimization via smooth approximation. IEEE Trans Neural Netw Learn Syst 25(3):545\u2013556","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3239_CR24","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.neucom.2013.01.025","volume":"120","author":"S Qin","year":"2013","unstructured":"Qin S, Bian W, Xue X (2013) A new one-layer recurrent neural network for nonsmooth pseudoconvex optimization. Neurocomputing 120:655\u2013662","journal-title":"Neurocomputing"},{"issue":"3","key":"3239_CR25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52(3):141\u2013152","journal-title":"Biol Cybern"},{"issue":"3","key":"3239_CR26","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TNNLS.2011.2181867","volume":"23","author":"W Bian","year":"2012","unstructured":"Bian W, Chen X (2012) Smoothing neural network for constrained non-Lipschitz optimization with applications. IEEE Trans Neural Netw Learn Syst 23(3):399\u2013411","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3239_CR27","unstructured":"Rozell CJ, Garrigues P (2010) Analog sparse approximation for compressed sensing recovery. In: Proceedings of the ASILOMAR conference on signals, systems and computers 2010, pp 822\u2013826"},{"key":"3239_CR28","unstructured":"Charles AS, Garrigues P, Rozell CJ (2011) Analog sparse approximation with applications to compressed sensing. arXiv preprint arXiv:1111.4118"},{"key":"3239_CR29","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.neucom.2013.09.028","volume":"129","author":"CS Leung","year":"2014","unstructured":"Leung CS, Sum J, Constantinides AG (2014) Recurrent networks for compressive sampling. Neurocomputing 129:298\u2013305","journal-title":"Neurocomputing"},{"issue":"10","key":"3239_CR30","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1109\/TNNLS.2016.2575860","volume":"28","author":"R Feng","year":"2017","unstructured":"Feng R, Leung CS, Constantinides AG, Zeng WJ (2017) Lagrange programming neural network for nondifferentiable optimization problems in sparse approximation. IEEE Trans Neural Netw Learn Syst 28(10):2395\u20132407","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3239_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2863-5","author":"H Wang","year":"2017","unstructured":"Wang H, Lee CM, Feng R, Leung CS (2017) An analog neural network approach for the least absolute shrinkage and selection operator problem. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-017-2863-5","journal-title":"Neural Comput Appl"},{"issue":"3","key":"3239_CR32","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1016\/j.neucom.2015.08.055","volume":"173","author":"Y Liu","year":"2016","unstructured":"Liu Y, Hu J (2016) A neural network for $$l_1$$ l 1 - $$l_2$$ l 2 minimization based on scaled gradient projection: application to compressed sensing. Neurocomputing 173(3):988\u2013993","journal-title":"Neurocomputing"},{"issue":"3","key":"3239_CR33","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TNNLS.2015.2481006","volume":"27","author":"Q Liu","year":"2016","unstructured":"Liu Q, Wang J (2016) $$L_1$$ L 1 -minimization algorithms for sparse signal reconstruction based on a projection neural network. IEEE Trans Neural Netw Learn Syst 27(3):698\u2013707","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3239_CR34","doi-asserted-by":"crossref","unstructured":"Guo Z, Wang J (2010) A neurodynamic optimization approach to constrained sparsity maximization based on alternative objective functions. In: Proceedings of the 2010 international joint conference on neural networks (IJCNN) 2010, pp 18\u201323","DOI":"10.1109\/IJCNN.2010.5596553"},{"issue":"7","key":"3239_CR35","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1109\/TNNLS.2014.2341654","volume":"26","author":"C Guo","year":"2015","unstructured":"Guo C, Yang Q (2015) A neurodynamic optimization method for recovery of compressive sensed signals with globally converged solution approximating to minimization $$L_0$$ L 0 . IEEE Trans Neural Netw Learn Syst 26(7):1363\u20131374","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3239_CR36","volume-title":"Nonlinear programming: theory and algorithms","author":"MS Bazaraa","year":"2013","unstructured":"Bazaraa MS, Sherali HD, Shetty CM (2013) Nonlinear programming: theory and algorithms. Wiley, New York"},{"issue":"1","key":"3239_CR37","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen X (2012) Smoothing methods for nonsmooth, nonconvex minimization. Math Program 134(1):71\u201399","journal-title":"Math Program"},{"issue":"12","key":"3239_CR38","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp JA, Gilbert AC (2007) Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans Inf Theory 53(12):4655\u20134666","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"3239_CR39","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell D, Tropp JA (2009) CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmon Anal 26(3):301\u2013321","journal-title":"Appl Comput Harmon Anal"},{"issue":"10","key":"3239_CR40","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp JA (2004) Greed is good: algorithmic results for sparse approximation. IEEE Trans Inf Theory 50(10):2231\u20132242","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"3239_CR41","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0894-0347-08-00610-3","volume":"22","author":"A Cohen","year":"2009","unstructured":"Cohen A, Dahmen W, DeVore R (2009) Compressed sensing and best $$k$$ k -term approximation. J Am Math Soc 22(1):211\u2013231","journal-title":"J Am Math Soc"},{"issue":"1","key":"3239_CR42","doi-asserted-by":"publisher","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 (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3(1):1\u2013122","journal-title":"Found Trends Mach Learn"},{"issue":"3","key":"3239_CR43","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"E Hale","year":"2008","unstructured":"Hale E, Yin W, Zhang Y (2008) Fixed-point continuation for $$l_1$$ l 1 -minimization: methodology and convergence. SIAM J Optim 19(3):1107\u20131130","journal-title":"SIAM J Optim"},{"issue":"1","key":"3239_CR44","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183\u2013202","journal-title":"SIAM J Imaging Sci"},{"issue":"10","key":"3239_CR45","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1162\/neco.2008.03-07-486","volume":"20","author":"CJ Rozell","year":"2008","unstructured":"Rozell CJ, Johnson DH, Baraniuk RG, Olshausen BA (2008) Sparse coding via thresholding and local competition in neural circuits. Neural Comput 20(10):2526\u20132563","journal-title":"Neural Comput"},{"issue":"12","key":"3239_CR46","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203\u20134215","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"3239_CR47","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.acha.2006.09.003","volume":"22","author":"R Gribonval","year":"2007","unstructured":"Gribonval R, Nielsen M (2007) Highly sparse representations from dictionaries are unique and independent of the sparseness measure. Appl Comput Harmon Anal 22(3):335\u2013355","journal-title":"Appl Comput Harmon Anal"},{"key":"3239_CR48","volume-title":"Optimization and nonsmooth analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke FH (1983) Optimization and nonsmooth analysis. Wiley, New York"},{"issue":"6","key":"3239_CR49","doi-asserted-by":"publisher","first-page":"3448","DOI":"10.1109\/TIT.2013.2248414","volume":"59","author":"A Bandeira","year":"2013","unstructured":"Bandeira A, Dobriban E, Mixon D, Sawin W (2013) Certifying the restricted isometry property is hard. IEEE Trans Inform Theory 59(6):3448\u20133450","journal-title":"IEEE Trans Inform Theory"},{"key":"3239_CR50","volume-title":"Applied nonlinear control","author":"JJE Slotine","year":"1991","unstructured":"Slotine JJE, Li W (1991) Applied nonlinear control. Englewood Cliffs, Prentice-Hall"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-3239-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-017-3239-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-3239-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T01:37:53Z","timestamp":1693186673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-017-3239-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,6]]},"references-count":50,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["3239"],"URL":"https:\/\/doi.org\/10.1007\/s00521-017-3239-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,6]]},"assertion":[{"value":"18 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}