乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:17:46Z","timestamp":1722903466143},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T00:00:00Z","timestamp":1717718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T00:00:00Z","timestamp":1717718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["EECS 2216912"],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS 1854831"],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"publisher","award":["HR00112190040"],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000142312863"],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10589-024-00583-7","type":"journal-article","created":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T20:07:12Z","timestamp":1717790832000},"page":"1-32","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Steffensen method"],"prefix":"10.1007","volume":"89","author":[{"given":"Minda","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Zehua","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Lek-Heng","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,7]]},"reference":[{"key":"583_CR1","first-page":"64","volume":"1","author":"JF Steffensen","year":"1933","unstructured":"Steffensen, J.F.: Remarks on iteration. Skand. Aktuarietidskr. 1, 64\u201372 (1933)","journal-title":"Skand. Aktuarietidskr."},{"key":"583_CR2","first-page":"44","volume":"28","author":"JF Steffensen","year":"1945","unstructured":"Steffensen, J.F.: Further remarks on iteration. Skand. Aktuarietidskr. 28, 44\u201355 (1945)","journal-title":"Skand. Aktuarietidskr."},{"issue":"2","key":"583_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10092-015-0142-3","volume":"53","author":"S Amat","year":"2016","unstructured":"Amat, S., Ezquerro, J.A., Hern\u00e1ndez-Ver\u00f3n, M.A.: On a Steffensen-like method for solving nonlinear equations. Calcolo 53(2), 171\u2013188 (2016)","journal-title":"Calcolo"},{"issue":"2","key":"583_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s11075-013-9732-9","volume":"66","author":"JA Ezquerro","year":"2014","unstructured":"Ezquerro, J.A., Hern\u00e1ndez-Ver\u00f3n, M.A., Rubio, M.J., Velasco, A.I.: An hybrid method that improves the accessibility of Steffensen\u2019s method. Numer. Algorithms 66(2), 241\u2013267 (2014)","journal-title":"Numer. Algorithms"},{"key":"583_CR5","volume-title":"Elements of Numerical Analysis","author":"P Henrici","year":"1964","unstructured":"Henrici, P.: Elements of Numerical Analysis. John Wiley, New York (1964)"},{"key":"583_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF00927440","volume":"5","author":"HY Huang","year":"1970","unstructured":"Huang, H.Y.: Unified approach to quadratically convergent algorithms for function minimization. J. Optim. Theory Appl. 5, 405\u2013423 (1970)","journal-title":"J. Optim. Theory Appl."},{"key":"583_CR7","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/0705026","volume":"5","author":"LW Johnson","year":"1968","unstructured":"Johnson, L.W., Scholz, D.R.: On Steffensen\u2019s method. SIAM J. Numer. Anal. 5, 296\u2013302 (1968)","journal-title":"SIAM J. Numer. Anal."},{"key":"583_CR8","doi-asserted-by":"crossref","unstructured":"Nedzhibov, G.H.: An approach to accelerate iterative methods for solving nonlinear operator equations. In: Applications of Mathematics in Engineering and Economics (AMEE\u201911). AIP Conf. Proc., vol. 1410, pp. 76\u201382. Amer. Inst. Phys., Melville (2011)","DOI":"10.1063\/1.3664358"},{"issue":"3","key":"583_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01385782","volume":"59","author":"Y Nievergelt","year":"1991","unstructured":"Nievergelt, Y.: Aitken\u2019s and Steffensen\u2019s accelerations in several variables. Numer. Math. 59(3), 295\u2013310 (1991)","journal-title":"Numer. Math."},{"issue":"3","key":"583_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0377-0427(94)00004-K","volume":"58","author":"Y Nievergelt","year":"1995","unstructured":"Nievergelt, Y.: The condition of Steffensen\u2019s acceleration in several variables. J. Comput. Appl. Math. 58(3), 291\u2013305 (1995)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"583_CR11","first-page":"369","volume":"33","author":"T Noda","year":"1981","unstructured":"Noda, T.: The Aitken-Steffensen method in the solution of simultaneous nonlinear equations. S\u016bgaku 33(4), 369\u2013372 (1981)","journal-title":"S\u016bgaku"},{"issue":"1","key":"583_CR12","first-page":"83","volume":"38","author":"T Noda","year":"1986","unstructured":"Noda, T.: The Aitken-Steffensen method in the solution of simultaneous nonlinear equations. II. S\u016bgaku 38(1), 83\u201385 (1986)","journal-title":"S\u016bgaku"},{"issue":"5","key":"583_CR13","doi-asserted-by":"publisher","first-page":"174","DOI":"10.3792\/pjaa.62.174","volume":"62","author":"T Noda","year":"1986","unstructured":"Noda, T.: The Aitken-Steffensen method in the solution of simultaneous nonlinear equations. III. Proc. Jpn. Acad. Ser. A Math. Sci. 62(5), 174\u2013177 (1986)","journal-title":"Proc. Jpn. Acad. Ser. A Math. Sci."},{"issue":"8","key":"583_CR14","doi-asserted-by":"publisher","first-page":"260","DOI":"10.3792\/pjaa.66.260","volume":"66","author":"T Noda","year":"1990","unstructured":"Noda, T.: The Aitken-Steffensen formula for systems of nonlinear equations. IV. Proc. Jpn. Acad. Ser. A Math. Sci. 66(8), 260\u2013263 (1990)","journal-title":"Proc. Jpn. Acad. Ser. A Math. Sci."},{"issue":"2","key":"583_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.3792\/pjaa.68.37","volume":"68","author":"T Noda","year":"1992","unstructured":"Noda, T.: The Aitken-Steffensen formula for systems of nonlinear equations. V. Proc. Jpn. Acad. Ser. A Math. Sci. 68(2), 37\u201340 (1992)","journal-title":"Proc. Jpn. Acad. Ser. A Math. Sci."},{"key":"583_CR16","doi-asserted-by":"crossref","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Numerical linear algebra and optimization. In: Classics in Applied Mathematics, vol. 83. Society for Industrial and Applied Mathematics, Philadelphia (2021)","DOI":"10.1137\/1.9781611976571"},{"key":"583_CR17","doi-asserted-by":"crossref","unstructured":"Allen-Zhu, Z.: Katyusha: The first direct acceleration of stochastic gradient methods. In: Hatami, H., McKenzie, P., King, V. (eds.) STOC\u201917: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Annual ACM Symposium on Theory of Computing, pp. 1200\u20131205 (2017)","DOI":"10.1145\/3055399.3055448"},{"key":"583_CR18","unstructured":"Woodworth, B., Srebro, N.: Tight complexity bounds for optimizing composite objectives. In: Lee, D., Sugiyama, M., Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems (NIPS 2016). Advances in Neural Information Processing Systems, vol. 29 (2016)"},{"key":"583_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58418-4","volume-title":"Extrapolation and Rational Approximation\u2013the Works of the Main Contributors","author":"C Brezinski","year":"2020","unstructured":"Brezinski, C., Redivo-Zaglia, M.: Extrapolation and Rational Approximation\u2013the Works of the Main Contributors. Springer, Cham (2020)"},{"key":"583_CR20","series-title":"International Series in Pure and Applied Mathematics","volume-title":"The Numerical Treatment of a Single Nonlinear Equation","author":"AS Householder","year":"1970","unstructured":"Householder, A.S.: The Numerical Treatment of a Single Nonlinear Equation. International Series in Pure and Applied Mathematics, McGraw-Hill, New York (1970)"},{"issue":"6","key":"583_CR21","first-page":"355","volume":"57","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angen\u00e4herte aufl\u00f6sung von systemen linearer gleichungen. Bull. Int. Acad. Polon. Sci. A 57(6), 355\u2013357 (1937)","journal-title":"Bull. Int. Acad. Polon. Sci. A"},{"issue":"6","key":"583_CR22","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1080\/00207179308934446","volume":"57","author":"S Kaczmarz","year":"1993","unstructured":"Kaczmarz, S.: Approximate solution of systems of linear equations. Int. J. Control 57(6), 1269\u20131271 (1993)","journal-title":"Int. J. Control"},{"issue":"2","key":"583_CR23","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2009","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15(2), 262\u2013278 (2009)","journal-title":"J. Fourier Anal. Appl."},{"key":"583_CR24","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"583_CR25","unstructured":"Roux, N.L., Schmidt, M., Bach, F.R.: A stochastic gradient method with an exponential convergence rate for finite training sets. In: Advances in Neural Information Processing Systems 25, pp. 2672\u20132680 (2012)"},{"key":"583_CR26","unstructured":"Defazio, A., Bach, F.R., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Advances in Neural Information Processing Systems 27, pp. 1646\u20131654 (2014)"},{"key":"583_CR27","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Advances in Neural Information Processing Systems 26, pp. 315\u2013323 (2013)"},{"key":"583_CR28","unstructured":"Moritz, P., Nishihara, R., Jordan, M.I.: A linearly-convergent stochastic L-BFGS algorithm. In: Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, AISTATS. JMLR Workshop and Conference Proceedings, vol. 51, pp. 249\u2013258 (2016)"},{"issue":"2","key":"583_CR29","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1137\/140954362","volume":"26","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Hansen, S.L., Nocedal, J., Singer, Y.: A stochastic quasi-Newton method for large-scale optimization. SIAM J. Optim. 26(2), 1008\u20131031 (2016)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"583_CR30","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1109\/TSP.2017.2784360","volume":"66","author":"R Zhao","year":"2018","unstructured":"Zhao, R., Haskell, W.B., Tan, V.Y.: Stochastic L-BFGS: improved convergence rates and practical acceleration strategies. IEEE Trans. Signal Process. 66(5), 1155\u20131169 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"583_CR31","first-page":"2121","volume":"12","author":"JC Duchi","year":"2011","unstructured":"Duchi, J.C., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"583_CR32","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: 3rd International Conference on Learning Representations, ICLR (2015)"},{"issue":"3","key":"583_CR33","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $$O(1\/k^{2})$$. Dokl. Akad. Nauk SSSR 269(3), 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"583_CR34","first-page":"791","volume":"4","author":"BT Poljak","year":"1964","unstructured":"Poljak, B.T.: Some methods of speeding up the convergence of iterative methods. \u017d. Vy\u010disl. Mat i Mat. Fiz. 4, 791\u2013803 (1964)","journal-title":"\u017d. Vy\u010disl. Mat i Mat. Fiz."},{"issue":"1","key":"583_CR35","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0893-6080(98)00116-6","volume":"12","author":"N Qian","year":"1999","unstructured":"Qian, N.: On the momentum term in gradient descent learning algorithms. Neural Netw. 12(1), 145\u2013151 (1999)","journal-title":"Neural Netw."},{"key":"583_CR36","unstructured":"Reddi, S.J., Kale, S., Kumar, S.: On the convergence of Adam and beyond. arXiv:1904.09237 (2019)"},{"issue":"1","key":"583_CR37","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"583_CR38","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1093\/imamat\/6.3.222","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms. II. The new algorithm. J. Inst. Math. Appl. 6, 222\u2013231 (1970)","journal-title":"J. Inst. Math. Appl."},{"issue":"3","key":"583_CR39","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13(3), 317\u2013322 (1970)","journal-title":"Comput. J."},{"key":"583_CR40","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable-metric methods derived by variational means. Math. Comput. 24, 23\u201326 (1970)","journal-title":"Math. Comput."},{"key":"583_CR41","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comput. 24, 647\u2013656 (1970)","journal-title":"Math. Comput."},{"key":"583_CR42","doi-asserted-by":"crossref","unstructured":"Potra, F.A.: On an iterative algorithm of order $$1.839\\cdots $$ for solving nonlinear operator equations. Numer. Funct. Anal. Optim. 7(1), 75\u2013106 (1984\/85)","DOI":"10.1080\/01630568508816182"},{"issue":"1\u20132, Ser. A","key":"583_CR43","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10107-015-0864-7","volume":"155","author":"D Needell","year":"2016","unstructured":"Needell, D., Srebro, N., Ward, R.: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. Math. Program. 155(1\u20132, Ser. A), 549\u2013573 (2016)","journal-title":"Math. Program."},{"key":"583_CR44","unstructured":"Babanezhad, R., Ahmed, M.O., Virani, A., Schmidt, M., Kone\u010dn\u00fd, J., Sallinen, S.: Stopwasting my gradients: practical SVRG. In: Advances in Neural Information Processing Systems 28, pp. 2251\u20132259 (2015)"},{"issue":"4","key":"583_CR45","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"583_CR46","unstructured":"Nitanda, A.: Accelerated stochastic gradient descent for minimizing finite sums. In: Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, AISTATS. JMLR Workshop and Conference Proceedings, vol. 51, pp. 195\u2013203 (2016)"},{"key":"583_CR47","unstructured":"Tan, C., Ma, S., Dai, Y., Qian, Y.: Barzilai-borwein step size for stochastic gradient descent. In: Advances in Neural Information Processing Systems 29, pp. 685\u2013693 (2016)"},{"key":"583_CR48","series-title":"Princeton Landmarks in Mathematics","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Landmarks in Mathematics, Princeton University Press, Princeton (1997)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00583-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00583-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00583-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T08:12:16Z","timestamp":1722845536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00583-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,7]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["583"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00583-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,6,7]]},"assertion":[{"value":"15 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}