{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:03:28Z","timestamp":1752282208614},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"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 Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00563-7","type":"journal-article","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T10:02:56Z","timestamp":1586340176000},"page":"1924-1952","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Weighted thresholding homotopy method for sparsity constrained optimization"],"prefix":"10.1007","volume":"44","author":[{"given":"Wenxing","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Huating","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Lanfan","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Jianli","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,8]]},"reference":[{"issue":"1","key":"563_CR1","first-page":"807","volume":"14","author":"S Bahmani","year":"2013","unstructured":"Bahmani S, Raj B, Boufounos P (2013) Greedy sparsity-constrained optimization. J Mach Learn Res 14(1):807\u2013841","journal-title":"J Mach Learn Res"},{"issue":"1","key":"563_CR2","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/moor.2015.0722","volume":"41","author":"A Beck","year":"2016","unstructured":"Beck A, Hallak N (2016) On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms. Math Oper Res 41(1):196\u2013223","journal-title":"Math Oper Res"},{"issue":"1","key":"563_CR3","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":"4","key":"563_CR4","doi-asserted-by":"publisher","first-page":"A1451","DOI":"10.1137\/110855867","volume":"36","author":"S Bi","year":"2014","unstructured":"Bi S, Liu X, Pan S (2014) Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation. SIAM J Sci Comput 36(4):A1451\u2013A1477","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"563_CR5","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.sigpro.2011.09.017","volume":"92","author":"T Blumensath","year":"2012","unstructured":"Blumensath T (2012) Accelerated iterative hard thresholding. Sig Process 92(3):752\u2013756","journal-title":"Sig Process"},{"issue":"5\u20136","key":"563_CR6","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath T, Davies ME (2008) Iterative thresholding for sparse approximations. J Fourier Anal Appl 14(5\u20136):629\u2013654","journal-title":"J Fourier Anal Appl"},{"issue":"2","key":"563_CR7","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"Blumensath T, Davies ME (2010) Normalised itertive hard thresholding: guaranteed stability and performance. IEEE J Sel Top Signal Process 4(2):298\u2013309","journal-title":"IEEE J Sel Top Signal Process"},{"issue":"12","key":"563_CR8","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203\u20134215","journal-title":"IEEE Trans Inf Theory"},{"issue":"5\u20136","key":"563_CR9","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s EJ, Wakin MB, Boyd SP (2008) Enhancing sparsity by reweighted $$l_1$$ minimization. J Fourier Anal Appl 14(5\u20136):877\u2013905","journal-title":"J Fourier Anal Appl"},{"key":"563_CR10","first-page":"1","volume":"20","author":"Y Chen","year":"2019","unstructured":"Chen Y, Ye Y, Wang M (2019) Approximation hardness for a class of sparse optimization problems. J Mach Learn Res 20:1\u201327","journal-title":"J Mach Learn Res"},{"issue":"4","key":"563_CR11","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TNNLS.2017.2658953","volume":"29","author":"Z Dong","year":"2018","unstructured":"Dong Z, Zhu W (2018) Homotopy methods based on $$l_0$$ norm for the compressed sensing problem. IEEE Trans Neural Netw Learn Syst 29(4):1132\u20131146","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"11","key":"563_CR12","doi-asserted-by":"publisher","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"DL Donoho","year":"2008","unstructured":"Donoho DL, Tsaig Y (2008) Fast solution of $$l_1$$-norm minimization problems when the solution may be sparse. IEEE Trans Inf Theory 54(11):4789\u20134812","journal-title":"IEEE Trans Inf Theory"},{"key":"563_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and redundant representations: from theory to applications in signal and image processing","author":"M Elad","year":"2010","unstructured":"Elad M (2010) Sparse and redundant representations: from theory to applications in signal and image processing. Springer, New York"},{"issue":"456","key":"563_CR14","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 Am Stat Assoc 96(456):1348\u20131360","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"563_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v033.i01","volume":"33","author":"J Friedman","year":"2010","unstructured":"Friedman J, Hastie T, Tibshirani R (2010) Regularization paths for generalized linear models via coordinate descent. J Stat Softw 33(1):1\u201322","journal-title":"J Stat Softw"},{"key":"563_CR16","first-page":"545","volume-title":"Advances in neural information processing system 17","author":"I Guyon","year":"2005","unstructured":"Guyon I, Gunn S, Ben-Hur A, Dror G (2005) Result analysis of the nips 2003 feature selection challenge. In: Saul LK, Weiss Y, Bottou L (eds) Advances in neural information processing system 17. MIT-Press, Cambridge, MA, pp 545\u2013552"},{"key":"563_CR17","unstructured":"Jain P, Rao N, Dhillon I (2016) Structured sparse regression via greedy hard-thresholding. In: Advances in neural information processing systems (NIPS), pp 1516\u20131524"},{"issue":"3","key":"563_CR18","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.acha.2014.10.001","volume":"39","author":"Y Jiao","year":"2015","unstructured":"Jiao Y, Jin B, Lu X (2015) A primal dual active set with continuation algorithm for the $$l_0$$-regularized optimization problem. Appl Comput Harmon Anal 39(3):400\u2013426","journal-title":"Appl Comput Harmon Anal"},{"key":"563_CR19","doi-asserted-by":"crossref","unstructured":"Khajehnejad MA, Xu W, Avestimehr AS, Hassibi B (2009) Weighted $$l_1$$ minimization for sparse recovery with prior information. In 2009 IEEE international conference on symposium on information theory, pp 483\u2013487","DOI":"10.1109\/ISIT.2009.5205716"},{"key":"563_CR20","first-page":"1519","volume":"8","author":"K Koh","year":"2007","unstructured":"Koh K, Kim S, Boyd S (2007) An interior-point method for large-scale $$l_1$$-regularized logistic regression. J Mach Learn Res 8:1519\u20131555","journal-title":"J Mach Learn Res"},{"issue":"1","key":"563_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11425-017-9315-9","volume":"62","author":"Q Li","year":"2019","unstructured":"Li Q, Bai Y, Yu C, Yuan Y-X (2019) A new piecewise quadratic approximation approach for $$l_0$$ norm minimization problem. Sci China Math 62(1):185\u2013204","journal-title":"Sci China Math"},{"key":"563_CR22","unstructured":"Li X, Zhao T, Arora R, Liu H, Haupt J (2016) Stochastic variance reduced optimization for nonconvex sparse learning. In: International conference on machine learning (ICML), pp 917\u2013925"},{"key":"563_CR23","unstructured":"Liu B, Yuan X, Wang L, Liu Q, Metaxas DN (2017) Dual iterative hard thresholding: from non-convex sparse minimization to non-smooth concave maximization. In: International conference on machine learning (ICML), pp 2179\u20132187"},{"issue":"4","key":"563_CR24","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s10898-018-0675-5","volume":"72","author":"Y Liu","year":"2018","unstructured":"Liu Y, Bi S, Pan S (2018) Equivalent Lipschitz surrogates for zero-norm and rank optimization problems. J Global Optim 72(4):679\u2013704","journal-title":"J Global Optim"},{"issue":"1\u20132","key":"563_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-013-0714-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu Z (2014) Iterative hard thresholding methods for $$l_0$$ regularized convex cone programming. Math Program 147(1\u20132):125\u2013154","journal-title":"Math Program"},{"issue":"4","key":"563_CR26","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu Z, Zhang Y (2013) Sparse approximation via penalty decomposition methods. SIAM J Optim 23(4):2448\u20132478","journal-title":"SIAM J Optim"},{"issue":"2\u20133","key":"563_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1561\/0600000058","volume":"8","author":"J Mairal","year":"2014","unstructured":"Mairal J, Bach F, Ponce J (2014) Sparse modeling for image and vision processing. Found Trends Comput Graphics Vis 8(2\u20133):85\u2013283","journal-title":"Found Trends Comput Graphics Vis"},{"issue":"12","key":"563_CR28","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S Mallat","year":"1993","unstructured":"Mallat S, Zhang Z (1993) Matching pursuits with time-frequency dictionaries. IEEE Trans Signal Process 41(12):3397\u20133415","journal-title":"IEEE Trans Signal Process"},{"issue":"3","key":"563_CR29","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"},{"key":"563_CR30","unstructured":"Newman D, Hrttich S, Blake C, Merz C (1998) UCI repository of machine learing databases. www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"11","key":"563_CR31","doi-asserted-by":"publisher","first-page":"6869","DOI":"10.1109\/TIT.2017.2749330","volume":"63","author":"N Nguyen","year":"2017","unstructured":"Nguyen N, Needell D, Woolf T (2017) Linear convergence of stochastic iterative greedy algorithms with sparse constraints. IEEE Trans Inf Theory 63(11):6869\u20136895","journal-title":"IEEE Trans Inf Theory"},{"issue":"9","key":"563_CR32","doi-asserted-by":"publisher","first-page":"4551","DOI":"10.1109\/TSP.2012.2203818","volume":"60","author":"K Qiu","year":"2012","unstructured":"Qiu K, Dogand\u017ei\u0107 A (2012) Sparse signal reconstruction via ecme hard thresholding. IEEE Trans Signal Process 60(9):4551\u20134569","journal-title":"IEEE Trans Signal Process"},{"issue":"11","key":"563_CR33","doi-asserted-by":"publisher","first-page":"2789","DOI":"10.1109\/TNNLS.2016.2600243","volume":"28","author":"A Rakotomamonjy","year":"2017","unstructured":"Rakotomamonjy A, Koco S, Ralaivola L (2017) Greedy methods, randomization approaches, and multiarm bandit algorithms for efficient sparsity-constrained optimization. IEEE Trans Neural Netw Learn Syst 28(11):2789\u20132802","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"5","key":"563_CR34","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/s10463-012-0396-3","volume":"65","author":"X Shen","year":"2013","unstructured":"Shen X, Pan W, Zhu Y, Zhou H (2013) On constrained and regularized high-dimensional regression. Ann Inst Stat Math 65(5):807\u2013832","journal-title":"Ann Inst Stat Math"},{"issue":"13","key":"563_CR35","doi-asserted-by":"publisher","first-page":"3301","DOI":"10.1109\/TSP.2015.2421476","volume":"63","author":"C Soussen","year":"2015","unstructured":"Soussen C, Idier J, Duan J, Brie D (2015) Homotopy based algorithms for $$l_0$$-regularized least-squares. IEEE Trans Signal Process 63(13):3301\u20133316","journal-title":"IEEE Trans Signal Process"},{"issue":"12","key":"563_CR36","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"},{"key":"563_CR37","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.artint.2015.02.008","volume":"224","author":"S Xiang","year":"2015","unstructured":"Xiang S, Shen X, Ye J (2015) Efficient nonconvex sparse group feature selection via continuous and discrete optimization. Artif Intell 224:28\u201350","journal-title":"Artif Intell"},{"issue":"2","key":"563_CR38","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1137\/120869997","volume":"23","author":"L Xiao","year":"2013","unstructured":"Xiao L, Zhang T (2013) A proximal-gradient homotopy method for the sparse least-squares problem. SIAM J Optim 23(2):1062\u20131091","journal-title":"SIAM J Optim"},{"issue":"7","key":"563_CR39","doi-asserted-by":"publisher","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 (2012) $$l_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans Neural Netw Learn Syst 23(7):1013\u20131027","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"563_CR40","first-page":"1","volume":"18","author":"X Yuan","year":"2018","unstructured":"Yuan X, Li P, Zhang T (2018) Gradient hard thresholding pursuit. J Mach Learn Res 18:1\u201343","journal-title":"J Mach Learn Res"},{"issue":"4","key":"563_CR41","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1214\/12-STS399","volume":"27","author":"C-H Zhang","year":"2012","unstructured":"Zhang C-H, Zhang T (2012) A general theory of concave regularization for high-dimensional sparse estimation problems. Stat Sci 27(4):576\u2013593","journal-title":"Stat Sci"},{"key":"563_CR42","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:1081\u20131107","journal-title":"J Mach Learn Res"},{"key":"563_CR43","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1109\/ACCESS.2015.2430359","volume":"3","author":"Z Zhang","year":"2015","unstructured":"Zhang Z, Xu Y, Yang J, Li X, Zhang D (2015) A survey of sparse representation: algorithms and applications. IEEE Access 3:490\u2013530","journal-title":"IEEE Access"},{"key":"563_CR44","doi-asserted-by":"publisher","DOI":"10.1201\/9781315113142","volume-title":"Sparse optimization theory and methods","author":"Y Zhao","year":"2018","unstructured":"Zhao Y (2018) Sparse optimization theory and methods. CRC Press\/Taylor and Francis Group, Boca Raton"},{"issue":"3","key":"563_CR45","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/110847445","volume":"22","author":"Y Zhao","year":"2012","unstructured":"Zhao Y, Li D (2012) Reweighted $$l_1$$-minimization for sparse solutions to underdetermined linear systems. SIAM J Optim 22(3):1065\u20131088","journal-title":"SIAM J Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00563-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00563-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00563-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:48:35Z","timestamp":1664354915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00563-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,8]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["563"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00563-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,8]]},"assertion":[{"value":"8 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}