{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:30Z","timestamp":1740109290997,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,28]],"date-time":"2017-03-28T00:00:00Z","timestamp":1490659200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10115-017-1047-z","type":"journal-article","created":{"date-parts":[[2017,3,28]],"date-time":"2017-03-28T16:07:38Z","timestamp":1490717258000},"page":"423-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A new accelerated proximal technique for regression with high-dimensional datasets"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9772-240X","authenticated-orcid":false,"given":"Mridula","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. K.","family":"Shukla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,28]]},"reference":[{"issue":"1","key":"1047_CR1","first-page":"61","volume":"8","author":"RP Agarwal","year":"2007","unstructured":"Agarwal RP, O\u2019Regan D, Sahu DR (2007) Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J Nonlinear Convex Anal 8(1):61\u201379","journal-title":"J Nonlinear Convex Anal"},{"key":"1047_CR2","unstructured":"Ando RK, Zhang T (2005) A framework for learning predictive structures from multiple tasks and unlabeled data. J Mach Learn Res 6:1817\u20131853, http:\/\/dl.acm.org\/citation.cfm?id=1046920.1194905"},{"issue":"3","key":"1047_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou A, Evgeniou T, Pontil M (2008) Convex multi-task feature learning. Mach Learn 73(3):243\u2013272. doi: 10.1007\/s10994-007-5040-8","journal-title":"Mach Learn"},{"issue":"4","key":"1047_CR4","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1214\/12-STS394","volume":"27","author":"F Bach","year":"2012","unstructured":"Bach F, Jenatton R, Mairal J, Obozinski G (2012) Structured sparsity through convex optimization. Stat Sci 27(4):450\u2013468. doi: 10.1214\/12-STS394","journal-title":"Stat Sci"},{"key":"1047_CR5","unstructured":"Bach FR (2008) Consistency of the group lasso and multiple kernel learning. J Mach Learn Res 9:1179\u20131225, http:\/\/dl.acm.org\/citation.cfm?id=1390681.1390721"},{"issue":"1","key":"1047_CR6","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. doi: 10.1137\/080716542","journal-title":"SIAM J Imaging Sci"},{"key":"1047_CR7","unstructured":"Bertsekas D (1999) Nonlinear programming, 2nd edn. Athena Scientific. http:\/\/www.amazon.com\/exec\/obidos\/redirect?tag=citeulike07-20&path=ASIN\/1886529000"},{"key":"1047_CR8","doi-asserted-by":"publisher","unstructured":"Bickel S, Bogojeska J, Lengauer T, Scheffer T (2008) Multi-task learning for HIV therapy screening. In: Proceedings of the 25th international conference on machine learning. ACM, New York, ICML \u201908, pp 56\u201363. doi: 10.1145\/1390156.1390164","DOI":"10.1145\/1390156.1390164"},{"issue":"3","key":"1047_CR9","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle A, Dossal C (2015) On the convergence of the iterates of the \u201cfast iterative shrinkage\/thresholding algorithm\u201d. J Optim Theory Appl 166(3):968\u2013982. doi: 10.1007\/s10957-015-0746-4","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"1047_CR10","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s10115-015-0894-8","volume":"48","author":"S Chang","year":"2016","unstructured":"Chang S, Qi GJ, Yang Y, Aggarwal CC, Zhou J, Wang M, Huang TS (2016) Large-scale supervised similarity learning in networks. Knowl Inform Syst 48(3):707\u2013740. doi: 10.1007\/s10115-015-0894-8","journal-title":"Knowl Inform Syst"},{"key":"1047_CR11","doi-asserted-by":"publisher","unstructured":"Chapelle O, Shivaswamy P, Vadrevu S, Weinberger K, Zhang Y, Tseng B (2010) Multi-task learning for boosting with application to web search ranking. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, KDD \u201910, pp 1189\u20131198. doi: 10.1145\/1835804.1835953","DOI":"10.1145\/1835804.1835953"},{"issue":"2","key":"1047_CR12","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1214\/11-AOAS514","volume":"6","author":"X Chen","year":"2012","unstructured":"Chen X, Lin Q, Kim S, Carbonell JG, Xing EP (2012) Smoothing proximal gradient method for general structured sparse regression. Ann Appl Stat 6(2):719\u2013752. doi: 10.1214\/11-AOAS514","journal-title":"Ann Appl Stat"},{"key":"1047_CR13","doi-asserted-by":"publisher","unstructured":"Collobert R, Weston J (2008) A unified architecture for natural language processing: deep neural networks with multitask learning. In: Proceedings of the 25th international conference on machine learning. ACM, New York, ICML \u201908, pp 160\u2013167. doi: 10.1145\/1390156.1390177","DOI":"10.1145\/1390156.1390177"},{"key":"1047_CR14","unstructured":"Daum\u00e9 H III, Kumar A, Saha A (2010) Frustratingly easy semi-supervised domain adaptation. In: Proceedings of the 2010 workshop on domain adaptation for natural language processing, association for computational linguistics, Stroudsburg, PA, DANLP 2010, pp 53\u201359. http:\/\/dl.acm.org\/citation.cfm?id=1870526.1870534"},{"key":"1047_CR15","unstructured":"Duchi J, Singer Y (2009) Efficient online and batch learning using forward backward splitting. J Mach Learn Res 10:2899\u20132934. http:\/\/dl.acm.org\/citation.cfm?id=1577069.1755882"},{"key":"1047_CR16","unstructured":"Jenatton R, Mairal J, Obozinski G, Bach F (2011) Proximal methods for hierarchical sparse coding. J Mach Learn Res 12:2297\u20132334. http:\/\/dl.acm.org\/citation.cfm?id=1953048.2021074"},{"key":"1047_CR17","doi-asserted-by":"crossref","unstructured":"Juditsky A, Nemirovski A (2012) First-order methods for nonsmooth convex large-scale optimization, I: general purpose methods. MIT Press, pp 121\u2013148. http:\/\/www.jstor.org\/stable\/j.ctt5hhgpg.9","DOI":"10.7551\/mitpress\/8996.003.0007"},{"key":"1047_CR18","doi-asserted-by":"publisher","unstructured":"Li B, Yang Q, Xue X (2009) Transfer learning for collaborative filtering via a rating-matrix generative model. In: Proceedings of the 26th annual international conference on machine learning. ACM, New York, ICML \u201909, pp 617\u2013624. doi: 10.1145\/1553374.1553454","DOI":"10.1145\/1553374.1553454"},{"key":"1047_CR19","doi-asserted-by":"publisher","unstructured":"Liu H, Palatucci M, Zhang J (2009) Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery. In: Proceedings of the 26th annual international conference on machine learning. ACM, New York, ICML \u201909, pp 649\u2013656. doi: 10.1145\/1553374.1553458","DOI":"10.1145\/1553374.1553458"},{"issue":"2","key":"1047_CR20","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10115-012-0545-2","volume":"36","author":"D Luo","year":"2013","unstructured":"Luo D, Ding C, Huang H (2013) Toward structural sparsity: an explicit $$l_2-l_0$$ l 2 - l 0 approach. Knowl Inform Syst 36(2):411\u2013438. doi: 10.1007\/s10115-012-0545-2","journal-title":"Knowl Inform Syst"},{"issue":"1","key":"1047_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.cam.2007.07.021","volume":"219","author":"PE Mainge","year":"2008","unstructured":"Mainge PE (2008) Convergence theorems for inertial km-type algorithms. J Comput Appl Math 219(1):223\u2013236. doi: 10.1016\/j.cam.2007.07.021","journal-title":"J Comput Appl Math"},{"key":"1047_CR22","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1090\/S0002-9939-1953-0054846-3","volume":"4","author":"WR Mann","year":"1953","unstructured":"Mann WR (1953) Mean value methods in iteration. Proc Am Math Soc 4:506\u2013510. doi: 10.1090\/S0002-9939-1953-0054846-3","journal-title":"Proc Am Math Soc"},{"key":"1047_CR23","unstructured":"Nesterov Y (2007) Gradient methods for minimizing composite objective function. CORE Discussion Papers 2007076, Universit catholique de Louvain, Center for Operations Research and Econometrics (CORE). http:\/\/EconPapers.repec.org\/RePEc:cor:louvco:2007076"},{"issue":"3","key":"1047_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh N, Boyd S (2014) Proximal algorithms. Found Trends Optim 1(3):127\u2013239. doi: 10.1561\/2400000003","journal-title":"Found Trends Optim"},{"key":"1047_CR25","doi-asserted-by":"publisher","unstructured":"Quattoni A, Carreras X, Collins M, Darrell T (2009) An efficient projection for l1,∞ regularization. In: Proceedings of the 26th annual international conference on machine learning. ACM, New York, ICML \u201909, pp 857\u2013864. doi: 10.1145\/1553374.1553484","DOI":"10.1145\/1553374.1553484"},{"issue":"1","key":"1047_CR26","first-page":"187","volume":"12","author":"DR Sahu","year":"2011","unstructured":"Sahu DR (2011) Applications of the s-iteration process to constrained minimization problems and split feasibility problems. Fixed Point Theory 12(1):187\u2013204","journal-title":"Fixed Point Theory"},{"key":"1047_CR27","doi-asserted-by":"crossref","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the lasso. J R Stat Soc Ser B (Methodol) 58(1):267\u2013288. http:\/\/www.jstor.org\/stable\/2346178","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"issue":"1","key":"1047_CR28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani R, Saunders M, Rosset S, Zhu J, Knight K (2005) Sparsity and smoothness via the fused lasso. J R Stat Soc Ser B (Stat Methodol) 67(1):91\u2013108. doi: 10.1111\/j.1467-9868.2005.00490.x","journal-title":"J R Stat Soc Ser B (Stat Methodol)"},{"issue":"3","key":"1047_CR29","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1198\/004017005000000139","volume":"47","author":"BA Turlach","year":"2005","unstructured":"Turlach BA, Venables WN, Wright SJ (2005) Simultaneous variable selection. Technometrics 47(3):349\u2013363. doi: 10.1198\/004017005000000139","journal-title":"Technometrics"},{"key":"1047_CR30","unstructured":"Wang J, Liu J, Ye J (2013) Efficient mixed-norm regularization: algorithms and safe screening methods. arXiv:1307.4156 abs\/CoRR"},{"issue":"6","key":"1047_CR31","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1(6):80\u201383","journal-title":"Biom Bull"},{"issue":"1","key":"1047_CR32","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 (2006) Model selection and estimation in regression with grouped variables. J R Stat Soc Ser B (Stat Methodol) 68(1):49\u201367. doi: 10.1111\/j.1467-9868.2005.00532.x","journal-title":"J R Stat Soc Ser B (Stat Methodol)"},{"key":"1047_CR33","doi-asserted-by":"crossref","unstructured":"Zhang S, Qian H, Gong X (2016) An alternating proximal splitting method with global convergence for nonconvex structured sparsity optimization. In: Proceedings of the thirtieth AAAI conference on artificial intelligence. AAAI Press, AAAI\u201916, pp 2330\u20132336, http:\/\/dl.acm.org\/citation.cfm?id=3016100.3016224","DOI":"10.1609\/aaai.v30i1.10253"},{"issue":"6A","key":"1047_CR34","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1214\/07-AOS584","volume":"37","author":"P Zhao","year":"2009","unstructured":"Zhao P, Rocha G, Yu B (2009) The composite absolute penalties family for grouped and hierarchical variable selection. Ann Stat 37(6A):3468\u20133497. doi: 10.1214\/07-AOS584","journal-title":"Ann Stat"},{"key":"1047_CR35","doi-asserted-by":"publisher","unstructured":"Zhou J, Yuan L, Liu J, Ye J (2011) A multi-task learning formulation for predicting disease progression. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, KDD \u201911, pp 814\u2013822, doi: 10.1145\/2020408.2020549","DOI":"10.1145\/2020408.2020549"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1047-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1047-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1047-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T22:01:08Z","timestamp":1692741668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1047-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,28]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1047"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1047-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2017,3,28]]}}}