{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:59:05Z","timestamp":1760597945518},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T00:00:00Z","timestamp":1586822400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T00:00:00Z","timestamp":1586822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11432-018-9832-y","type":"journal-article","created":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T14:02:36Z","timestamp":1587045756000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An accelerator for the logistic regression algorithm based on sampling on-demand"],"prefix":"10.1007","volume":"63","author":[{"given":"Jiye","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunsheng","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuangyin","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"key":"9832_CR1","doi-asserted-by":"publisher","first-page":"082302","DOI":"10.1007\/s11432-015-1016-x","volume":"60","author":"G T Bai","year":"2017","unstructured":"Bai G T, Tao R, Zhao J, et al. Fast FOCUSS method based on bi-conjugate gradient and its application to space-time clutter spectrum estimation. Sci China Inf Sci, 2017, 60: 082302","journal-title":"Sci China Inf Sci"},{"key":"9832_CR2","doi-asserted-by":"publisher","first-page":"112203","DOI":"10.1007\/s11432-015-0096-3","volume":"59","author":"C H Li","year":"2016","unstructured":"Li C H, Zhang E C, Jiu L, et al. Optimal control on special Euclidean group via natural gradient algorithm. Sci China Inf Sci, 2016, 59: 112203","journal-title":"Sci China Inf Sci"},{"key":"9832_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov Y. Primal-dual subgradient methods for convex problems. Math Program, 2009, 120: 221\u2013259","journal-title":"Math Program"},{"key":"9832_CR4","unstructured":"Lei L H, Jordan M I. Less than a single pass: stochastically controlled stochastic gradient. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS), Florida, 2017. 148\u2013156"},{"key":"9832_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/100808563","volume":"22","author":"S J Wright","year":"2012","unstructured":"Wright S J. Accelerated block-coordinate relaxation for regularized optimization. SIAM J Optim, 2012, 22: 159\u2013186","journal-title":"SIAM J Optim"},{"key":"9832_CR6","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz S, Zhang T. Stochastic dual coordinate ascent methods for regularized loss minimization. J Mach Learn Res, 2013, 14: 567\u2013599","journal-title":"J Mach Learn Res"},{"key":"9832_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1287\/ijoc.2014.0623","volume":"27","author":"M Lubin","year":"2015","unstructured":"Lubin M, Dunning I. Computing in operations research using Julia. INFORMS J Comput, 2015, 27: 238\u2013248","journal-title":"INFORMS J Comput"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9832-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-018-9832-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9832-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T14:17:28Z","timestamp":1681309048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-018-9832-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,14]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["9832"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9832-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,14]]},"assertion":[{"value":"2 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"169102"}}