{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T21:28:30Z","timestamp":1782250110721,"version":"3.54.5"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000121","name":"division of mathematical sciences","doi-asserted-by":"publisher","award":["1723005"],"award-info":[{"award-number":["1723005"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"national science foundation","doi-asserted-by":"publisher","award":["CCF-1231216"],"award-info":[{"award-number":["CCF-1231216"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"h2020 european research council","doi-asserted-by":"publisher","award":["SLING 819789"],"award-info":[{"award-number":["SLING 819789"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"h2020 marie sklodowska-curie actions","doi-asserted-by":"publisher","award":["861137"],"award-info":[{"award-number":["861137"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"horizon 2020 framework programme","doi-asserted-by":"publisher","award":["NoMADS - DLV-777826."],"award-info":[{"award-number":["NoMADS - DLV-777826."]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"afosr","doi-asserted-by":"crossref","award":["FA9550- 18-1-7009"],"award-info":[{"award-number":["FA9550- 18-1-7009"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"afosr","doi-asserted-by":"crossref","award":["FA9550-17-1-0390"],"award-info":[{"award-number":["FA9550-17-1-0390"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"afosr","doi-asserted-by":"crossref","award":["BAA-AFRL-AFOSR-2016-0007"],"award-info":[{"award-number":["BAA-AFRL-AFOSR-2016-0007"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10107-022-01866-9","type":"journal-article","created":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T15:21:05Z","timestamp":1659453665000},"page":"1179-1219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Zeroth-order optimization with orthogonal random directions"],"prefix":"10.1007","volume":"199","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3795-5834","authenticated-orcid":false,"given":"David","family":"Kozak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cesare","family":"Molinari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Rosasco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luis","family":"Tenorio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Silvia","family":"Villa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,2]]},"reference":[{"key":"1866_CR1","unstructured":"Agarwal, A., Dekel, O., Xiao, L.: Optimal algorithms for online convex optimization with multi-point bandit feedback. In: Proceedings of the Twenty Third Annual Conference on Computational Learning Theory, Citeseer, pp.\u00a028\u201340 (2010)"},{"key":"1866_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1866_CR3","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/090767911","volume":"32","author":"H Avron","year":"2010","unstructured":"Avron, H., Maymounkov, P., Toledo, S.: Blendenpik: supercharging Lapack\u2019s least-squares solver. SIAM J. Sci. Comput. 32, 1217\u20131236 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1866_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF03007664","volume":"26","author":"J-B Baillon","year":"1977","unstructured":"Baillon, J.-B., Haddad, G.: Quelques propri\u00e9t\u00e9s des op\u00e9rateurs angle-born\u00e9s et n-cycliquement monotones. Israel J. Math. 26, 137\u2013150 (1977)","journal-title":"Israel J. Math."},{"key":"1866_CR5","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23, 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"1866_CR6","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1137\/18M1177718","volume":"29","author":"AS Berahas","year":"2019","unstructured":"Berahas, A.S., Byrd, R.H., Nocedal, J.: Derivative-free optimization of noisy functions via quasi-Newton methods. SIAM J. Optim. 29, 965\u2013993 (2019)","journal-title":"SIAM J. Optim."},{"key":"1866_CR7","unstructured":"Berahas, A.S., Cao, L., Choromanski, K., Scheinberg, K.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization, arXiv preprint arXiv:1905.01332, (2019)"},{"key":"1866_CR8","unstructured":"Berahas, A.S., Cao, L., Scheinberg, K.: Global convergence rate analysis of a generic line search algorithm with noise, arXiv preprint arXiv:1910.04055, (2019)"},{"key":"1866_CR9","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/S1052623497331063","volume":"10","author":"DP Bertsekas","year":"2000","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Gradient convergence in gradient methods with errors. SIAM J. Optim. 10, 627\u2013642 (2000)","journal-title":"SIAM J. Optim."},{"key":"1866_CR10","unstructured":"Bollapragada R., Wild, S.M.: Adaptive sampling quasi-Newton methods for derivative-free stochastic optimization, arXiv preprint arXiv:1910.13516, (2019)"},{"key":"1866_CR11","doi-asserted-by":"crossref","unstructured":"Cartis, C., Roberts, L.: Scalable subspace methods for derivative-free nonlinear least-squares optimization, arXiv preprint arXiv:2102.12016, (2021)","DOI":"10.1007\/s10107-022-01836-1"},{"key":"1866_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169, 337\u2013375 (2018)","journal-title":"Math. Program."},{"key":"1866_CR13","first-page":"536","volume":"25","author":"A Cauchy","year":"1847","unstructured":"Cauchy, A.: M\u00e9thode g\u00e9n\u00e9rale pour la r\u00e9solution des systemes d\u2019\u00e9quations simultan\u00e9es. Comp. Rend. Sci. Paris 25, 536\u2013538 (1847)","journal-title":"Comp. Rend. Sci. Paris"},{"key":"1866_CR14","unstructured":"Choromanski, K., Rowland, M., Sindhwani, V., Turner, R., Weller, A.: Structured evolution with compact architectures for scalable policy optimization. In: Dy, J., Krause, A. (Eds.), Proceedings of the 35th International Conference on Machine Learning, vol.\u00a080 of Proceedings of Machine Learning Research, Stockholmsm\u00e4ssan, Stockholm Sweden, PMLR, pp.\u00a0970\u2013978, (10\u201315 Jul 2018)"},{"key":"1866_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1214\/aoms\/1177728716","volume":"25","author":"KL Chung","year":"1954","unstructured":"Chung, K.L.: On a stochastic approximation method. Ann. Math. Stat. 25, 463\u2013483 (1954)","journal-title":"Ann. Math. Stat."},{"key":"1866_CR16","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1137\/140971233","volume":"25","author":"PL Combettes","year":"2015","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping. SIAM J. Optim. 25, 1221\u20131248 (2015)","journal-title":"SIAM J. Optim."},{"key":"1866_CR17","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to derivative-free optimization, vol.\u00a08 of MPS\/SIAM Series on Optimization, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Programming Society (MPS), Philadelphia, PA (2009)"},{"key":"1866_CR18","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s11590-015-0908-1","volume":"10","author":"M Dodangeh","year":"2016","unstructured":"Dodangeh, M., Vicente, L.N., Zhang, Z. a: On the optimal order of worst case complexity of direct search. Optim. Lett. 10, 699\u2013708 (2016)","journal-title":"Optim. Lett."},{"key":"1866_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S., Sarl\u00f3s, T.: Faster least squares approximation. Numer. Math. 117, 219\u2013249 (2011)","journal-title":"Numer. Math."},{"key":"1866_CR20","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","volume":"61","author":"JC Duchi","year":"2015","unstructured":"Duchi, J.C., Jordan, M.I., Wainwright, M.J., Wibisono, A.: Optimal rates for zero-order convex optimization: The power of two function evaluations. IEEE Trans. Inf. Theory 61, 2788\u20132806 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1866_CR21","unstructured":"Ehrhardt, M.J., Riis, E.S., Ringholm, T., Sch\u00f6nlieb, C.-B.: A geometric integration approach to smooth optimisation: Foundations of the discrete gradient method, arXiv preprint arXiv:1805.06444, (2018)"},{"key":"1866_CR22","first-page":"339","volume":"5","author":"DE Finkel","year":"2009","unstructured":"Finkel, D.E., Kelley, C.T.: Convergence analysis of sampling methods for perturbed Lipschitz functions. Pac. J. Optim. 5, 339\u2013349 (2009)","journal-title":"Pac. J. Optim."},{"key":"1866_CR23","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, pp.\u00a0385\u2013394 (2005)"},{"key":"1866_CR24","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23, 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"1866_CR25","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/0805015","volume":"5","author":"P Gilmore","year":"1995","unstructured":"Gilmore, P., Kelley, C.T.: An implicit filtering algorithm for optimization of functions with many local minima. SIAM J. Optim. 5, 269\u2013285 (1995)","journal-title":"SIAM J. Optim."},{"key":"1866_CR26","doi-asserted-by":"crossref","unstructured":"Gilmore, P., Kelley, C.T., Miller, C.T., Williams, G.A.: Implicit filtering and optimal design problems. In: Optimal design and control (Blacksburg, VA, 1994), vol.\u00a019 of Progr. Systems Control Theory, Birkh\u00e4user Boston, Boston, MA, pp.\u00a0159\u2013176 (1995)","DOI":"10.1007\/978-1-4612-0839-6_10"},{"key":"1866_CR27","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic descent. SIAM J. Optim. 25, 1515\u20131541 (2015)","journal-title":"SIAM J. Optim."},{"key":"1866_CR28","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/aa747c","volume":"50","author":"V Grimm","year":"2017","unstructured":"Grimm, V., McLachlan, R.I., McLaren, D.I., Quispel, G., Sch\u00f6nlieb, C.: Discrete gradient methods for solving variational image regularisation models. J. Phys. A: Math. Theor. 50, 295201 (2017)","journal-title":"J. Phys. A: Math. Theor."},{"key":"1866_CR29","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01071397","volume":"13","author":"A Gupal","year":"1977","unstructured":"Gupal, A.: A method for the minimization of almost-differentiable functions. Cybern. 13, 115\u2013117 (1977)","journal-title":"Cybern."},{"key":"1866_CR30","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BF01073313","volume":"13","author":"A Gupal","year":"1977","unstructured":"Gupal, A., Norkin, V.: Algorithm for the minimization of discontinuous functions. Cybern. 13, 220\u2013223 (1977)","journal-title":"Cybern."},{"key":"1866_CR31","unstructured":"Hanzely, F., Doikov, N., Nesterov, Y., Richtarik, P.: Stochastic subspace cubic Newton method. In: Proceedings of the 37th International Conference on Machine Learning, H.\u00a0D. III and A.\u00a0Singh, eds., vol.\u00a0119 of Proceedings of Machine Learning Research, PMLR, pp.\u00a04027\u20134038 (13\u201318 Jul 2020)"},{"key":"1866_CR32","unstructured":"Hanzely, F., Kovalev, D., Richtarik, P.: Variance reduced coordinate descent with acceleration: New method with a surprising application to finite-sum problems. In: Proceedings of the 37th International Conference on Machine Learning, H.\u00a0D. III and A.\u00a0Singh, eds., vol.\u00a0119 of Proceedings of Machine Learning Research, PMLR, pp.\u00a04039\u20134048 (13\u201318 Jul 2020)"},{"key":"1866_CR33","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer, pp.\u00a0795\u2013811 (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"1866_CR34","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23, 462\u2013466 (1952)","journal-title":"Ann. Math. Stat."},{"key":"1866_CR35","doi-asserted-by":"crossref","unstructured":"Bromwich, T.: Theory and application of infinite series. By Knopp K. Translated from the second German edition by Miss Young R.C. pp. xii 572. 30s. net. 1928. (Blackie) Math. Gaz. 14(199), 370\u2013371. Cambridge University Press (1929). https:\/\/doi.org\/:10.2307\/3606730","DOI":"10.2307\/3606730"},{"key":"1866_CR36","unstructured":"Konecn\u00fd, J., Richt\u00e1rik, P.: Simple complexity analysis of simplified direct search, arXiv preprint arXiv:1411.5873, (2014)"},{"key":"1866_CR37","unstructured":"Kozak, D., Becker, S., Doostan, A., Tenorio, L.: Stochastic subspace descent, arXiv preprint arXiv:1904.01145, (2019)"},{"key":"1866_CR38","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10589-021-00271-w","volume":"79","author":"D Kozak","year":"2021","unstructured":"Kozak, D., Becker, S., Doostan, A., Tenorio, L.: A stochastic subspace approach to gradient-free optimization in high dimensions. Comput. Optim. Appl. 79, 339\u2013368 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"1866_CR39","doi-asserted-by":"crossref","unstructured":"Kushner, H.J., Clark, D.S.: Stochastic approximation methods for constrained and unconstrained systems. Applied Mathematical Sciences, vol. 26. Springer-Verlag, New York-Berlin (1978)","DOI":"10.1007\/978-1-4684-9352-8"},{"key":"1866_CR40","first-page":"1800","volume-title":"Advances in Neural Information Processing Systems 31","author":"H Mania","year":"2018","unstructured":"Mania, H., Guy, A., Recht, B.: Simple random search of static linear policies is competitive for reinforcement learning. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 31, pp. 1800\u20131809. Curran Associates, Inc., New York (2018)"},{"key":"1866_CR41","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0962492920000021","volume":"29","author":"P-G Martinsson","year":"2020","unstructured":"Martinsson, P.-G., Tropp, J.A.: Randomized numerical linear algebra: foundations and algorithms. Acta Numer. 29, 403\u2013572 (2020)","journal-title":"Acta Numer."},{"key":"1866_CR42","first-page":"246","volume":"26","author":"J Matyas","year":"1965","unstructured":"Matyas, J.: Random optimization. Autom. Remote. Control. 26, 246\u2013253 (1965)","journal-title":"Autom. Remote. Control."},{"key":"1866_CR43","first-page":"592","volume":"54","author":"F Mezzadri","year":"2007","unstructured":"Mezzadri, F.: How to generate random matrices from the classical compact groups. Notices Amer. Math. Soc. 54, 592\u2013604 (2007)","journal-title":"Notices Amer. Math. Soc."},{"key":"1866_CR44","unstructured":"Nesterov, Y.: Random gradient-free minimization of convex functions. LIDAM Discussion Papers CORE 2011001, Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE), (Jan. 2011)"},{"key":"1866_CR45","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17, 527\u2013566 (2017). (First appeard as CORE discussion paper 2011)","journal-title":"Found. Comput. Math."},{"key":"1866_CR46","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","volume":"73","author":"Z\u00a0a Opial","year":"1967","unstructured":"Opial, Z.\u00a0a: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Amer. Math. Soc. 73, 591\u2013597 (1967)","journal-title":"Bull. Amer. Math. Soc."},{"key":"1866_CR47","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/18M1216250","volume":"30","author":"C Paquette","year":"2020","unstructured":"Paquette, C., Scheinberg, K.: A stochastic line search method with expected complexity analysis. SIAM J. Optim. 30, 349\u2013376 (2020)","journal-title":"SIAM J. Optim."},{"key":"1866_CR48","volume-title":"Introduction to optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to optimization, vol. 1. Optimization Software Inc., New York (1987)"},{"key":"1866_CR49","first-page":"1467","volume":"24","author":"LA Rastrigin","year":"1963","unstructured":"Rastrigin, L.A.: About convergence of random search method in extremal control of multi-parameter systems. Avtomat. i Telemekh 24, 1467\u20131473 (1963)","journal-title":"Avtomat. i Telemekh"},{"key":"1866_CR50","unstructured":"Riis, E.S., Ehrhardt, M.J., Quispel, G., Sch\u00f6nlieb, C.-B.: A geometric integration approach to nonsmooth, nonconvex optimisation, arXiv preprint arXiv:1807.07554, (2018)"},{"key":"1866_CR51","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":"1866_CR52","doi-asserted-by":"crossref","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Optimizing methods in statistics (Proc. Sympos., Ohio State Univ., Columbus, Ohio, 1971), pp.\u00a0233\u2013257 (1971)","DOI":"10.1016\/B978-0-12-604550-5.50015-8"},{"key":"1866_CR53","unstructured":"Salimans, T., Ho, J., Chen, X., Sidor, S., Sutskever, I.: Evolution strategies as a scalable alternative to reinforcement learning, arXiv preprint arXiv:1703.03864, (2017)"},{"key":"1866_CR54","unstructured":"Salzo, S., Villa, S.: Parallel random block-coordinate forward-backward algorithm: A unified convergence analysis, arXiv preprint arXiv:1906.07392, (2019)"},{"key":"1866_CR55","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization, arXiv preprint arXiv:1109.2415, (2011)"},{"key":"1866_CR56","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/9.119632","volume":"37","author":"JC Spall","year":"1992","unstructured":"Spall, J.C.: Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans. Automat. Control 37, 332\u2013341 (1992)","journal-title":"IEEE Trans. Automat. Control"},{"key":"1866_CR57","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1080\/10556788.2017.1392517","volume":"33","author":"R Tappenden","year":"2018","unstructured":"Tappenden, R., Tak\u00e1\u010d, M., Richt\u00e1rik, P.: On the complexity of parallel coordinate descent. Optim. Methods Softw. 33, 372\u2013395 (2018)","journal-title":"Optim. Methods Softw."},{"key":"1866_CR58","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8, 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"key":"1866_CR59","doi-asserted-by":"crossref","first-page":"iv+157","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends Theor. Comput. Sci. 10, iv+157 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1866_CR60","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151, 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"1866_CR61","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01100240","volume":"3","author":"SK Zavriev","year":"1993","unstructured":"Zavriev, S.K.: On the global optimization properties of finite-difference local descent algorithms. J. Global Optim. 3, 67\u201378 (1993)","journal-title":"J. Global Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01866-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01866-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01866-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T17:36:15Z","timestamp":1682098575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01866-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":61,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1866"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01866-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"19 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}