{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:31:41Z","timestamp":1762507901498,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T00:00:00Z","timestamp":1574035200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T00:00:00Z","timestamp":1574035200000},"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":["11771275"],"award-info":[{"award-number":["11771275"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10878-019-00479-x","type":"journal-article","created":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T14:02:38Z","timestamp":1574085758000},"page":"760-784","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A sparse optimization problem with hybrid $$L_2{\\text {-}}L_p$$ regularization for application of magnetic resonance brain images"],"prefix":"10.1007","volume":"42","author":[{"given":"Xuerui","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanqin","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,18]]},"reference":[{"issue":"4","key":"479_CR1","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s10878-015-9851-4","volume":"30","author":"MZ Bai","year":"2015","unstructured":"Bai MZ, Ren CY, Liu Y (2015a) A note of reduced dimension optimization algorithm of assignment problem. J Comb Optim 30(4):841\u2013849","journal-title":"J Comb Optim"},{"issue":"4","key":"479_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/s10878-015-9848-z","volume":"30","author":"YQ Bai","year":"2015","unstructured":"Bai YQ, Han X, Chen T, Yu H (2015b) Quadratic kernel-free least squares support vector machine for target diseases classification. J Comb Optim 30(4):850\u2013870","journal-title":"J Comb Optim"},{"issue":"1","key":"479_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":"12","key":"479_CR4","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":"1","key":"479_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jvcir.2012.10.006","volume":"24","author":"WF Cao","year":"2013","unstructured":"Cao WF, Sun J, Xu ZB (2013) 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(1):31\u201341","journal-title":"J Vis Commun Image R"},{"issue":"1\u20132","key":"479_CR6","first-page":"47","volume":"59","author":"XJ Chen","year":"2014","unstructured":"Chen XJ, Zhou WJ (2014) Convergence of the reweighted $$l_1$$ minimization algorithm for $$l_2-l_p$$ minimization. SIAM J Comput 59(1\u20132):47\u201361","journal-title":"SIAM J Comput"},{"key":"479_CR7","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"XJ Chen","year":"2014","unstructured":"Chen XJ, Ge DD, Wang ZZ, Ye YY (2014) Complexity of unconstrained $$l_2-l_p$$ minimization. Math Program 143:371\u2013383","journal-title":"Math Program"},{"issue":"4","key":"479_CR8","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s10878-015-9856-z","volume":"30","author":"X Chen","year":"2015","unstructured":"Chen X, Fan ZP, Li ZW, Han XL, Zhang X, Jia HC (2015) A two-stage method for member selection of emergency medical service. J Comb Optim 30(4):871\u2013891","journal-title":"J Comb Optim"},{"key":"479_CR9","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s40305-018-0202-x","volume":"6","author":"WY Cheng","year":"2018","unstructured":"Cheng WY, Li DH (2018) A preconditioned conjugate gradient method with active set strategy for $$l_1$$-regularized least squares. J Oper Res Soc China 6:571\u2013585","journal-title":"J Oper Res Soc China"},{"issue":"11","key":"479_CR10","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies I, Defrise M, Christine DM (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun Pure Appl Math 57(11):1413\u20131457","journal-title":"Commun Pure Appl Math"},{"issue":"3","key":"479_CR11","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho DL (1995) De-noising by soft-thresholding. IEEE Trans Inf Theory 41(3):613\u2013627","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"479_CR12","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":"45","key":"479_CR13","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(45):1348\u20131360","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"479_CR14","doi-asserted-by":"publisher","first-page":"95C113","DOI":"10.1007\/s10878-017-0212-3","volume":"37","author":"L Gai","year":"2019","unstructured":"Gai L, Ji JD (2019) An integrated method to solve the healthcare facility layout problem under area constraints. J Comb Optim 37(1):95C113","journal-title":"J Comb Optim"},{"issue":"2019","key":"479_CR15","first-page":"142C155","volume":"487","author":"S Jiang","year":"2019","unstructured":"Jiang S, Fang SC, An Q, Lavery JE (2019) A sub-one quasi-norm-based similarity measure for collaborative filtering in recommender systems. Inform Sci 487(2019):142C155","journal-title":"Inform Sci"},{"issue":"1","key":"479_CR16","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"MJ Lai","year":"2011","unstructured":"Lai MJ, Wang JY (2011) An unconstrained $$l_q$$ minimization with $$0<q\\le 1$$ for sparse solution of underdetermined linear systems. SIAM J Optim 21(1):82\u2013101","journal-title":"SIAM J Optim"},{"issue":"4","key":"479_CR17","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1007\/s10878-015-9849-y","volume":"30","author":"J Li","year":"2015","unstructured":"Li J, Dong M, Ren YJ, Yin KQ (2015) How patient compliance impacts the recommendations for colorectal cancer screening. J Comb Optim 30(4):920\u2013937","journal-title":"J Comb Optim"},{"issue":"1","key":"479_CR18","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 YQ, Yu CJ, Yuan YX (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"},{"issue":"1","key":"479_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"YF Lou","year":"2015","unstructured":"Lou YF, Yin PH, He Q, Xin J (2015) Computing sparse representation in a highly coherent dictionary based on difference of $$l_1$$ and $$l_2$$. J Sci Comput 64(1):178\u2013196","journal-title":"J Sci Comput"},{"key":"479_CR20","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1002\/mrm.21391","volume":"58","author":"M Lustig","year":"2007","unstructured":"Lustig M, Donoho DL, Pauly JM (2007) Sparse mri: the application of compressed sensing for rapid mr imaging. Magn Reson Med 58:1182\u20131195","journal-title":"Magn Reson Med"},{"issue":"1","key":"479_CR21","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1214\/07-AOS582","volume":"37","author":"N Meinshausen","year":"2009","unstructured":"Meinshausen N, Yu B (2009) Lasso-type recovery of sparse representations for high-dimensional data. Ann Stat 37(1):246\u2013270","journal-title":"Ann Stat"},{"issue":"2","key":"479_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natraajan","year":"1995","unstructured":"Natraajan BK (1995) Sparse approximate solutions to linear systems. SIAM J Comput 24(2):227\u2013234","journal-title":"SIAM J Comput"},{"issue":"1","key":"479_CR23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the lasso. J R Stat Soc B 58(1):267\u2013288","journal-title":"J R Stat Soc B"},{"issue":"2","key":"479_CR24","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright J, Yang AY, Ganesh A, Sastry S, Ma Y (2009) Robust face recognition via sparse representation. IEEE Trans Pattern Anal 31(2):210\u2013227","journal-title":"IEEE Trans Pattern Anal"},{"issue":"7","key":"479_CR25","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"ZB Xu","year":"2012","unstructured":"Xu ZB, Chang XY, Xu FM, Zhang H (2012) $$l_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans Neural Netw Learn 23(7):1013\u20131027","journal-title":"IEEE Trans Neural Netw Learn"},{"issue":"4","key":"479_CR26","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1007\/s10878-015-9853-2","volume":"30","author":"Y Yang","year":"2015","unstructured":"Yang Y, Shen B, Gao W, Liu Y, Zhong LW (2015) A surgical scheduling method considering surgeons preferences. J Comb Optim 30(4):1016\u20131026","journal-title":"J Comb Optim"},{"issue":"1","key":"479_CR27","doi-asserted-by":"publisher","first-page":"286C292","DOI":"10.1007\/s10878-017-0224-z","volume":"37","author":"LW Zhong","year":"2019","unstructured":"Zhong LW, Bai YQ (2019) Three-sided stable matching problem with two of them as cooperative partners. J Comb Optim 37(1):286C292","journal-title":"J Comb Optim"},{"issue":"476","key":"479_CR28","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1198\/016214506000000735","volume":"101","author":"H Zou","year":"2006","unstructured":"Zou H (2006) The adaptive lasso and its oracle properties. J Am Stat Assoc 101(476):1418\u20131429","journal-title":"J Am Stat Assoc"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00479-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-019-00479-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00479-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T03:37:47Z","timestamp":1722051467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-019-00479-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,18]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["479"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00479-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,11,18]]},"assertion":[{"value":"18 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}