{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T17:02:56Z","timestamp":1756573376670,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T00:00:00Z","timestamp":1439164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1447566, IIS-1422557,CCF-1451986, CNS-1314560, IIS-0953274, IIS-1029711"],"award-info":[{"award-number":["IIS-1447566, IIS-1422557,CCF-1451986, CNS-1314560, IIS-0953274, IIS-1029711"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005923","name":"Institute of Biomedical Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Yahoo"},{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","award":["NNX12AQ39A"],"award-info":[{"award-number":["NNX12AQ39A"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,10]]},"DOI":"10.1145\/2783258.2783400","type":"proceedings-article","created":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T15:38:27Z","timestamp":1438961907000},"page":"497-506","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Accelerated Alternating Direction Method of Multipliers"],"prefix":"10.1145","author":[{"given":"Mojtaba","family":"Kadkhodaie","sequence":"first","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}]},{"given":"Konstantina","family":"Christakopoulou","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}]},{"given":"Maziar","family":"Sanjabi","sequence":"additional","affiliation":[{"name":"University of Minnesota, minneapolis, MN, USA"}]},{"given":"Arindam","family":"Banerjee","sequence":"additional","affiliation":[{"name":"University of Minnesota, minneapolis, MN, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,8,10]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.72"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_2_5_1","volume-title":"NIPS, 953--961","author":"Boyd S.","year":"2012","unstructured":"S. Boyd , C. Cortes , M. Mohri , and A. Radovanovic . Accuracy at the top . In NIPS, 953--961 , 2012 . S. Boyd, C. Cortes, M. Mohri, and A. Radovanovic. Accuracy at the top. In NIPS, 953--961, 2012."},{"key":"e_1_3_2_2_6_1","first-page":"23","article-title":"From RankNet to LambdaRank to LambdaMART: An overview","volume":"11","author":"Burges C. JC","year":"2010","unstructured":"C. JC Burges . From RankNet to LambdaRank to LambdaMART: An overview . In Learning , 11 : 23 -- 581 , 2010 . C. JC Burges. From RankNet to LambdaRank to LambdaMART: An overview. In Learning, 11: 23--581, 2010.","journal-title":"Learning"},{"key":"e_1_3_2_2_7_1","volume-title":"Yahoo! Learning to Rank Challenge, 1--24","author":"Cao Z.","year":"2011","unstructured":"Z. Cao , T. Qin , T.-Y. Liu , M.-F. Tsai , and H. Li . Learning to rank: from pairwise approach to listwise approach . In Yahoo! Learning to Rank Challenge, 1--24 , 2011 .9 Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li. Learning to rank: from pairwise approach to listwise approach. In Yahoo! Learning to Rank Challenge, 1--24, 2011.9"},{"key":"e_1_3_2_2_8_1","unstructured":"I. Dhillon and J. Ghosh. Dirty statistical models.  I. Dhillon and J. Ghosh. Dirty statistical models."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9150-3"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755882"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1949-007-x"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"e_1_3_2_2_13_1","volume-title":"Fast alternating linearization methods for minimizing the sum of two convex functions. Mathematical Programming, 141(1--2):349--382","author":"Goldfarb D.","year":"2013","unstructured":"D. Goldfarb , S. Ma , and K. Scheinberg . Fast alternating linearization methods for minimizing the sum of two convex functions. Mathematical Programming, 141(1--2):349--382 , 2013 . D. Goldfarb, S. Ma, and K. Scheinberg. Fast alternating linearization methods for minimizing the sum of two convex functions. Mathematical Programming, 141(1--2):349--382, 2013."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/120896219"},{"key":"e_1_3_2_2_15_1","first-page":"121","volume-title":"Optimization for Machine Learning","author":"Juditsky A.","year":"2010","unstructured":"A. Juditsky and A. Nemirovski . First order methods for nonsmooth convex large-scale optimization, i: general purpose methods . Optimization for Machine Learning , pages 121 -- 148 , 2010 . A. Juditsky and A. Nemirovski. First order methods for nonsmooth convex large-scale optimization, i: general purpose methods. Optimization for Machine Learning, pages 121--148, 2010."},{"key":"e_1_3_2_2_16_1","first-page":"2267","volume-title":"NIPS","author":"Kasiviswanathan S. P.","year":"2012","unstructured":"S. P. Kasiviswanathan , H. Wang , A. Banerjee , and P. Melville . Online l1-dictionary learning with application to novel document detection . In NIPS , pages 2267 -- 2275 , 2012 . S. P. Kasiviswanathan, H. Wang, A. Banerjee, and P. Melville. Online l1-dictionary learning with application to novel document detection. In NIPS, pages 2267--2275, 2012."},{"key":"e_1_3_2_2_17_1","volume-title":"Direct optimization of ranking measures. In arXiv preprint arXiv:0704.3359","author":"Le Q.","year":"2007","unstructured":"Q. Le , and A. Smola . Direct optimization of ranking measures. In arXiv preprint arXiv:0704.3359 , 2007 . Q. Le, and A. Smola. Direct optimization of ranking measures. In arXiv preprint arXiv:0704.3359, 2007."},{"key":"e_1_3_2_2_18_1","volume-title":"NIPS","author":"Li N.","year":"2014","unstructured":"N. Li , R. Jin , and Z-H Zhou . Top rank optimization in linear time . In NIPS , 2014 . N. Li, R. Jin, and Z-H Zhou. Top rank optimization in linear time. In NIPS, 2014."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_2_20_1","first-page":"372","volume-title":"Soviet Mathematics Doklady","volume":"27","author":"Nesterov Y.","year":"1983","unstructured":"Y. Nesterov . A method of solving a convex programming problem with convergence rate o (1\/k2) . In Soviet Mathematics Doklady , volume 27 , pages 372 -- 376 , 1983 . Y. Nesterov. A method of solving a convex programming problem with convergence rate o (1\/k2). In Soviet Mathematics Doklady, volume 27, pages 372--376, 1983."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00433-7"},{"key":"e_1_3_2_2_22_1","volume-title":"Sparse support vector infinite push. arXiv preprint arXiv:1206.6432","author":"Rakotomamonjy A.","year":"2012","unstructured":"A. Rakotomamonjy . Sparse support vector infinite push. arXiv preprint arXiv:1206.6432 , 2012 . A. Rakotomamonjy. Sparse support vector infinite push. arXiv preprint arXiv:1206.6432, 2012."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755861"},{"key":"e_1_3_2_2_24_1","series-title":"Series B (Methodological)","first-page":"267","volume-title":"Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society","author":"Tibshirani R.","year":"1996","unstructured":"R. Tibshirani . Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society . Series B (Methodological) , pages 267 -- 288 , 1996 . R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological), pages 267--288, 1996."},{"key":"e_1_3_2_2_25_1","volume-title":"Online alternating direction method. arXiv preprint arXiv:1206.6448","author":"Wang H.","year":"2012","unstructured":"H. Wang and A. Banerjee . Online alternating direction method. arXiv preprint arXiv:1206.6448 , 2012 . H. Wang and A. Banerjee. Online alternating direction method. arXiv preprint arXiv:1206.6448, 2012."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048473"},{"key":"e_1_3_2_2_27_1","first-page":"611","volume-title":"Advances in Neural Information Processing Systems","author":"Yang E.","year":"2013","unstructured":"E. Yang and P. Ravikumar . Dirty statistical models . In Advances in Neural Information Processing Systems , pages 611 -- 619 , 2013 . E. Yang and P. Ravikumar. Dirty statistical models. In Advances in Neural Information Processing Systems, pages 611--619, 2013."},{"key":"e_1_3_2_2_28_1","volume-title":"Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):301--320","author":"Zou H.","year":"2005","unstructured":"H. Zou and T. Hastie . Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):301--320 , 2005 . H. Zou and T. Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):301--320, 2005."}],"event":{"name":"KDD '15: The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Sydney NSW Australia","acronym":"KDD '15"},"container-title":["Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783400","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2783258.2783400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:23Z","timestamp":1750223243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,10]]},"references-count":28,"alternative-id":["10.1145\/2783258.2783400","10.1145\/2783258"],"URL":"https:\/\/doi.org\/10.1145\/2783258.2783400","relation":{},"subject":[],"published":{"date-parts":[[2015,8,10]]},"assertion":[{"value":"2015-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}