{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:51Z","timestamp":1740124011987,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Beijing Natural Science Foundation","award":["Z190002"],"award-info":[{"award-number":["Z190002"]}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2018MA019"],"award-info":[{"award-number":["ZR2018MA019"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071022"],"award-info":[{"award-number":["12071022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10957-022-02156-2","type":"journal-article","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T20:02:52Z","timestamp":1673640172000},"page":"829-854","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Greedy Newton-Type Method for Multiple Sparse Constraint Problem"],"prefix":"10.1007","volume":"196","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0642-7446","authenticated-orcid":false,"given":"Jun","family":"Sun","sequence":"first","affiliation":[]},{"given":"Lingchen","family":"Kong","sequence":"additional","affiliation":[]},{"given":"Biao","family":"Qu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"2156_CR1","doi-asserted-by":"publisher","first-page":"2452","DOI":"10.1214\/12-AOS1032","volume":"40","author":"A Agarwal","year":"2012","unstructured":"Agarwal, A., Negahban, S., Wainwright, M.: Fast global convergence of gradient methods for high-dimensional statistical recovery. Ann. Stat. 40, 2452\u20132482 (2012)","journal-title":"Ann. Stat."},{"key":"2156_CR2","first-page":"807","volume":"14","author":"S Bahmani","year":"2013","unstructured":"Bahmani, S., Raj, B., Boufounos, P.: Greedy sparsity-constrained optimization. J. Mach. Learn. Res. 14, 807\u2013841 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"2156_CR3","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.: Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM. J. Optim. 23, 1480\u20131509 (2013)","journal-title":"SIAM. J. Optim."},{"key":"2156_CR4","doi-asserted-by":"publisher","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":"2156_CR5","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Berg","year":"2008","unstructured":"Berg, E., Friedlander, M.P.: Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31, 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"2156_CR6","first-page":"1935","volume":"24","author":"A Jalali","year":"2011","unstructured":"Jalali, A., Johnson, C., Ravikumar, P.: On learning discrete graphical models using Greedy methods. Adv. Neural Inf. Process. Syst. 24, 1935\u20131943 (2011). (Granada, Spain)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2156_CR7","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1109\/TSP.2016.2630028","volume":"65","author":"Y Jiao","year":"2017","unstructured":"Jiao, Y., Jin, B., Lu, X.: Group sparse recovery via the $$\\ell ^0(\\ell ^2)$$ penalty: theory and algorithm. IEEE Trans. Signal Process. 65, 998\u20131012 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"2156_CR8","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J., Sorensen, D.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"2156_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/19M1304799","volume":"14","author":"L Pan","year":"2021","unstructured":"Pan, L., Chen, X.: Group sparse optimization for images recovery using capped folded concave functions. SIAM J. Imaging. Sci. 14, 1\u201325 (2021)","journal-title":"SIAM J. Imaging. Sci."},{"key":"2156_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s40305-015-0101-3","volume":"3","author":"L Pan","year":"2017","unstructured":"Pan, L., Xiu, N., Zhou, S.: On solutions of sparsity constrained optimization. J. Oper. Res. Soc. China 3, 421\u2013439 (2017)","journal-title":"J. Oper. Res. Soc. China"},{"key":"2156_CR11","first-page":"325","volume":"33","author":"L Pan","year":"2017","unstructured":"Pan, L., Zhou, S., Xiu, N., Qi, H.: A convergent iterative hard thresholding for sparsity and nonnegativity constrained optimization. Pac. J. Optim. 33, 325\u2013353 (2017)","journal-title":"Pac. J. Optim."},{"key":"2156_CR12","volume-title":"Variational Analysis","author":"R Rockafellar","year":"2009","unstructured":"Rockafellar, R., Wets, R.: Variational Analysis. Springer, Berlin (2009)"},{"key":"2156_CR13","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1137\/090759574","volume":"20","author":"S Shalev-Shwartz","year":"2010","unstructured":"Shalev-Shwartz, S., Srebro, N., Zhang, T.: Trading accuracy for sparsity in optimization problems with sparsity constraints. SIAM. J. Optim. 20, 2807\u20132832 (2010)","journal-title":"SIAM. J. Optim."},{"key":"2156_CR14","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1080\/01621459.2020.1850460","volume":"117","author":"Y She","year":"2021","unstructured":"She, Y., Wang, Z., Shen, J.: Gaining outlier resistance with progressive quantiles: fast algorithms and theoretical studies. J. Am. Stat. Assoc. 117, 1282\u20131295 (2021)","journal-title":"J. Am. Stat. Assoc."},{"key":"2156_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114872","volume":"422","author":"J Sun","year":"2023","unstructured":"Sun, J., Kong, L., Zhou, S.: Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications. J. Comput. Appl. Math. 422, 114872 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"2156_CR16","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1097\/WCO.0b013e32833b764c","volume":"23","author":"P Thompson","year":"2010","unstructured":"Thompson, P., Martin, N., Wright, M.: Imaging genomics. Curr. Opin. Neurol. 23, 368\u2013373 (2010)","journal-title":"Curr. Opin. Neurol."},{"key":"2156_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ajhg.2011.11.029","volume":"90","author":"P Visscher","year":"2012","unstructured":"Visscher, P., Brown, M., Mccarthy, M., Yang, J.: Five years of GWAS discovery. Am. J. Hum. Genet. 90, 7\u201324 (2012)","journal-title":"Am. J. Hum. Genet."},{"key":"2156_CR18","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/TNNLS.2019.2905261","volume":"31","author":"R Wang","year":"2020","unstructured":"Wang, R., Xiu, N., Zhang, C.: Greedy projected gradient-Newton method for sparse logistic regression. IEEE Trans Neural Netw. Learn. Syst. 31, 527\u2013538 (2020)","journal-title":"IEEE Trans Neural Netw. Learn. Syst."},{"key":"2156_CR19","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1371\/journal.pgen.0020015","volume":"2","author":"S Wang","year":"2006","unstructured":"Wang, S., Yehya, N., Schadt, E., Wang, H., Drake, T., Lusis, A.: Genetic and genomic analysis of a fat mass trait with complex inheritance reveals marked sex specificity. PLoS Genet. 2, 148\u2013159 (2006)","journal-title":"PLoS Genet."},{"key":"2156_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. B. 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. B."},{"key":"2156_CR21","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1007\/s00439-014-1473-x","volume":"133","author":"H Zhang","year":"2014","unstructured":"Zhang, H., Wang, F., Xu, H., Liu, Y., Liu, J., Zhao, H., Gelernter, J.: Differentially co-expressed genes in postmortem prefrontal cortex of individuals with alcohol use disorders: influence on alcohol metabolism-related pathways. Hum. Genet. 133, 1383\u20131394 (2014)","journal-title":"Hum. Genet."},{"key":"2156_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.acha.2022.06.002","volume":"61","author":"S Zhou","year":"2022","unstructured":"Zhou, S.: Gradient projection Newton pursuit for sparsity constrained optimization. Appl. Comput. Harmon. Anal. 61, 75\u2013100 (2022)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2156_CR23","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1109\/TSP.2022.3156911","volume":"70","author":"S Zhou","year":"2022","unstructured":"Zhou, S., Luo, Z., Xiu, N.: Computing one-bit compressive sensing via double-sparsity constrained optimization. IEEE Trans. Signal. Proces. 70, 1593\u20131608 (2022)","journal-title":"IEEE Trans. Signal. Proces."},{"key":"2156_CR24","first-page":"1","volume":"22","author":"S Zhou","year":"2021","unstructured":"Zhou, S., Xiu, N., Qi, H.: Global and quadratic convergence of Newton hard-thresholding pursuit. J. Mach. Learn. Res. 22, 1\u201345 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"2156_CR25","doi-asserted-by":"publisher","first-page":"2561","DOI":"10.1109\/TMI.2017.2721301","volume":"37","author":"P Zille","year":"2018","unstructured":"Zille, P., Calhoun, V., Wang, Y.: Enforcing co-expression within a brain-imaging genomics regression framework. IEEE Trans. Med. Imaging 37, 2561\u20132571 (2018)","journal-title":"IEEE Trans. Med. Imaging"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02156-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02156-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02156-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T03:02:33Z","timestamp":1679886153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02156-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,13]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["2156"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02156-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2023,1,13]]},"assertion":[{"value":"28 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}