{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:04:05Z","timestamp":1777655045476,"version":"3.51.4"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T00:00:00Z","timestamp":1618272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T00:00:00Z","timestamp":1618272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","award":["DE-SC0006402"],"award-info":[{"award-number":["DE-SC0006402"]}],"id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-145460"],"award-info":[{"award-number":["CMMI-145460"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS- 1723005"],"award-info":[{"award-number":["DMS- 1723005"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1819251"],"award-info":[{"award-number":["DMS-1819251"]}],"id":[{"id":"10.13039\/100000001","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":[[2021,6]]},"DOI":"10.1007\/s10589-021-00271-w","type":"journal-article","created":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T12:35:09Z","timestamp":1618317309000},"page":"339-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A stochastic subspace approach to gradient-free optimization in high dimensions"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3795-5834","authenticated-orcid":false,"given":"David","family":"Kozak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Doostan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Tenorio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,13]]},"reference":[{"key":"271_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1013155928900","volume":"5","author":"Y Abacioglu","year":"2001","unstructured":"Abacioglu, Y., Oliver, D., Reynolds, A.: Efficient reservoir history matching using subspace vectors. Comput. Geosci. 5, 151\u2013172 (2001)","journal-title":"Comput. Geosci."},{"key":"271_CR2","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson\u2013Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66, 671\u2013687 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"271_CR3","unstructured":"Allen-Zhu, Z., Qu, Z., Richt\u00e1rik, P., Yuan, Y.: Even faster accelerated coordinate descent using non-uniform sampling. In: ICML, pp.\u00a01110\u20131119 (2016)"},{"key":"271_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1051\/ps\/2019018","volume":"24","author":"J Arbel","year":"2020","unstructured":"Arbel, J., Marchal, O., Nguyen, H.D.: On strict sub-Gaussianity, optimal proxy variance and symmetry for bounded random variables. ESAIM Probab. Stat. 24, 39\u201355 (2020)","journal-title":"ESAIM Probab. Stat."},{"key":"271_CR5","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":"271_CR6","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":"271_CR7","unstructured":"Berahas, A.S., Cao, L., Scheinberg, K.: Global convergence rate analysis of a generic line search algorithm with noise (2019)"},{"key":"271_CR8","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1145\/1008731.1008733","volume":"51","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Vempala, S.: Solving convex programs by random walks. J. ACM 51, 540\u2013556 (2004)","journal-title":"J. ACM"},{"key":"271_CR9","doi-asserted-by":"publisher","first-page":"2376","DOI":"10.1002\/2017WR021870","volume":"54","author":"EK Bjarkason","year":"2018","unstructured":"Bjarkason, E.K., Maclaren, O.J., O\u2019Sullivan, J.P., O\u2019Sullivan, M.J.: Randomized truncated SVD Levenberg\u2013Marquardt approach to geothermal natural state and history matching. Water Resour. Res. 54, 2376\u20132404 (2018)","journal-title":"Water Resour. Res."},{"key":"271_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60, 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"271_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"271_CR12","doi-asserted-by":"publisher","first-page":"A2494","DOI":"10.1137\/12089586X","volume":"35","author":"T Bui-Thanh","year":"2013","unstructured":"Bui-Thanh, T., Ghattas, O., Martin, J., Stadler, G.: A computational framework for infinite-dimensional Bayesian inverse problems part I: the linearized case, with application to global seismic inversion. SIAM J. Sci. Comput. 35, A2494\u2013A2523 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"271_CR13","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":"271_CR14","unstructured":"Choromanski, K., Rowland, M., Sindhwani, V., Turner, R.E., Weller, A.: Structured evolution with compact architectures for scalable policy optimization. In: ICML (2018)"},{"key":"271_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization, vol. 8. SIAM, Philadelphia (2009)"},{"key":"271_CR16","doi-asserted-by":"publisher","first-page":"114015","DOI":"10.1088\/0266-5611\/30\/11\/114015","volume":"30","author":"T Cui","year":"2014","unstructured":"Cui, T., Martin, J., Marzouk, Y.M., Solonen, A., Spantini, A.: Likelihood-informed dimension reduction for nonlinear inverse problems. Inverse Prob. 30, 114015 (2014)","journal-title":"Inverse Prob."},{"key":"271_CR17","doi-asserted-by":"publisher","first-page":"3185","DOI":"10.1137\/080742506","volume":"20","author":"F Dabbene","year":"2010","unstructured":"Dabbene, F., Shcherbakov, P.S., Polyak, B.T.: A randomized cutting plane method with probabilistic geometric convergence. SIAM J. Optim. 20, 3185\u20133207 (2010)","journal-title":"SIAM J. Optim."},{"key":"271_CR18","doi-asserted-by":"crossref","unstructured":"De, S., Maute, K., Doostan, A.: Bi-fidelity stochastic gradient descent for structural optimization under uncertainty. arXiv preprint arXiv:1911.10420 (2019)","DOI":"10.1007\/s00466-020-01870-w"},{"key":"271_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"271_CR20","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-013-0653-0","volume":"145","author":"Y Drori","year":"2014","unstructured":"Drori, Y., Teboulle, M.: Performance of first-order methods for smooth convex minimization: a novel approach. Math. Program. 145, 451\u2013482 (2014)","journal-title":"Math. Program."},{"key":"271_CR21","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":"271_CR22","unstructured":"Dvurechensky, P., Gasnikov, A., Gorbunov, E.: An accelerated directional derivative method for smooth stochastic convex optimization. arXiv preprint arXiv:1804.02394 (2018)"},{"key":"271_CR23","unstructured":"Dvurechensky, P., Gasnikov, A., Tiurin, A.: Randomized similar triangles method: a unifying framework for accelerated randomized optimization methods (coordinate descent, directional search, derivative-free method). arXiv preprint arXiv:1707.08486 (2017)"},{"key":"271_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61370-8","volume-title":"Numerical Techniques for Stochastic Optimization","author":"Y Ermoliev","year":"1988","unstructured":"Ermoliev, Y., Wets, R.-B.: Numerical Techniques for Stochastic Optimization. Springer, Berlin (1988)"},{"key":"271_CR25","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/090780717","volume":"33","author":"H Flath","year":"2011","unstructured":"Flath, H., Wilcox, L., Ak\u00e7elik, V., Hill, J., Van Bloemen Waanders, B., Ghattas, O.: Fast algorithms for Bayesian uncertainty quantification in large-scale linear inverse problems based on low-rank partial hessian approximations. SIAM J. Sci. Comput. 33, 407\u2013432 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"271_CR26","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF00049302","volume":"42","author":"P Frankl","year":"1990","unstructured":"Frankl, P., Maehara, H.: Some geometric applications of the beta distribution. Ann. Inst. Stat. Math. 42, 463\u2013474 (1990)","journal-title":"Ann. Inst. Stat. Math."},{"key":"271_CR27","unstructured":"Gaviano, M.: Some general results on convergence of random search algorithms in minimization problems. Towards Glob. Optim. 149\u2013157 (1975)"},{"key":"271_CR28","unstructured":"Ge, R., Huang, F., Jin, C., Yuan, Y.: Escaping from saddle points: online stochastic gradient for tensor decomposition. In: Conference on Learning Theory, pp.\u00a0797\u2013842 (2015)"},{"issue":"1","key":"271_CR29","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(1), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"271_CR30","unstructured":"Gower, R.M., Richt\u00e1rik, P.: Stochastic dual ascent for solving linear systems. arXiv preprint arXiv:1512.06890 (2015)"},{"key":"271_CR31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717761","volume-title":"Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation","author":"A Griewank","year":"2008","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, vol. 105, 2nd edn. SIAM, Philadelphia (2008)","edition":"2"},{"key":"271_CR32","volume-title":"Perspectives in Flow Control and Optimization","author":"MD Gunzburger","year":"2003","unstructured":"Gunzburger, M.D.: Perspectives in Flow Control and Optimization, vol. 5. SIAM, Philadelphia (2003)"},{"key":"271_CR33","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1137\/11081126X","volume":"22","author":"E Haber","year":"2012","unstructured":"Haber, E., Chung, M., Herrmann, F.: An effective method for parameter estimation with PDE constraints with multiple right-hand sides. SIAM J. Optim. 22, 739\u2013757 (2012)","journal-title":"SIAM J. Optim."},{"key":"271_CR34","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10589-011-9404-4","volume":"52","author":"E Haber","year":"2012","unstructured":"Haber, E., Magnant, Z., Lucero, C., Tenorio, L.: Numerical methods for A-optimal designs with a sparsity constraint for ill-posed inverse problems. Comput. Optim. Appl. 52, 293\u2013314 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"271_CR35","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG\\_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"271_CR36","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9, 159\u2013195 (2001)","journal-title":"Evol. Comput."},{"key":"271_CR37","unstructured":"Hanzely, F., Richt\u00e1rik, P.: Accelerated coordinate descent with arbitrary sampling and best rates for minibatches. arXiv preprint arXiv:1809.09354 (2018)"},{"key":"271_CR38","series-title":"Wiley Series in Computational Statistics","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/9780470685853.ch13","volume-title":"Large-Scale Inverse Problems and Quantification of Uncertainty","author":"L Horesh","year":"2010","unstructured":"Horesh, L., Haber, E., Tenorio, L.: Optimal experimental design for the large-scale nonlinear ill-posed problem of impedance imaging. In: Biegler, L., et al. (eds.) Large-Scale Inverse Problems and Quantification of Uncertainty. Wiley Series in Computational Statistics, pp. 273\u2013290. Wiley, Chichester (2010)"},{"key":"271_CR39","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/140964795","volume":"25","author":"X Hua","year":"2015","unstructured":"Hua, X., Yamashita, N.: Iteration complexity of a block coordinate gradient descent method for convex optimization. SIAM J. Optim. 25, 1298\u20131313 (2015)","journal-title":"SIAM J. Optim."},{"key":"271_CR40","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.jcp.2015.04.047","volume":"296","author":"T Isaac","year":"2015","unstructured":"Isaac, T., Petra, N., Stadler, G., Ghattas, O.: Scalable and efficient algorithms for the propagation of uncertainty from data through inference to prediction for large-scale problems, with application to flow of the Antarctic ice sheet. J. Comput. Phys. 296, 348\u2013368 (2015)","journal-title":"J. Comput. Phys."},{"key":"271_CR41","first-page":"315","volume":"26","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. NIPS 26, 315\u2013323 (2013)","journal-title":"NIPS"},{"key":"271_CR42","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1214\/aoms\/1177697089","volume":"41","author":"GS Kimeldorf","year":"1970","unstructured":"Kimeldorf, G.S., Wahba, G.: A correspondence between Bayesian estimation on stochastic processes and smoothing by splines. Ann. Math. Stat. 41, 495\u2013502 (1970)","journal-title":"Ann. Math. Stat."},{"key":"271_CR43","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"271_CR44","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/02331930903100141","volume":"60","author":"D Leventhal","year":"2011","unstructured":"Leventhal, D., Lewis, A.: Randomized Hessian estimation and directional search. Optimization 60, 329\u2013345 (2011)","journal-title":"Optimization"},{"key":"271_CR45","first-page":"3384","volume":"28","author":"H Lin","year":"2015","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: A universal catalyst for first-order optimization. NIPS 28, 3384\u20133392 (2015)","journal-title":"NIPS"},{"key":"271_CR46","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-23099-8","volume-title":"Automated Solution of Differential Equations by the Finite Element Method: The FEniCS Book","author":"A Logg","year":"2012","unstructured":"Logg, A., Mardal, K.-A., Wells, G.: Automated Solution of Differential Equations by the Finite Element Method: The FEniCS Book, vol. 84. Springer, Berlin (2012)"},{"key":"271_CR47","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1137\/15M1031679","volume":"28","author":"A Maggiar","year":"2018","unstructured":"Maggiar, A., W\u00e4chter, A., Dolinskaya, I.S., Staum, J.: A derivative-free trust-region algorithm for the optimization of functions smoothed via Gaussian convolution using adaptive multiple importance sampling. SIAM J. Optim. 28, 1478\u20131507 (2018)","journal-title":"SIAM J. Optim."},{"key":"271_CR48","doi-asserted-by":"publisher","unstructured":"Marchal, O., Arbel, J., et al.: On the sub-Gaussianity of the beta and Dirichlet distributions. Electron. Commun. Probab. 22 (2017). https:\/\/doi.org\/10.1214\/17-ECP92","DOI":"10.1214\/17-ECP92"},{"key":"271_CR49","unstructured":"Mezzadri, F.: How to generate random matrices from the classical compact groups. In: Notices of the American Mathematical Society, vol.\u00a054 (2006)"},{"key":"271_CR50","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$\\cal{O}(1\/k^2)$$. Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"271_CR51","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22, 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"271_CR52","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, Berlin (2013)"},{"key":"271_CR53","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17, 527\u2013566 (2017). First appeared as CORE discussion paper 2011","DOI":"10.1007\/s10208-015-9296-2"},{"key":"271_CR54","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.2514\/1.J051859","volume":"51","author":"EJ Nielsen","year":"2013","unstructured":"Nielsen, E.J., Diskin, B.: Discrete adjoint-based design for unsteady turbulent flows on dynamic overset unstructured grids. AIAA J. 51, 1355\u20131373 (2013)","journal-title":"AIAA J."},{"key":"271_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, Berlin (1999)","edition":"2"},{"key":"271_CR56","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":"271_CR57","doi-asserted-by":"publisher","first-page":"A2851","DOI":"10.1137\/15M1024950","volume":"38","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: Arock: an algorithmic framework for asynchronous parallel coordinate updates. SIAM J. Sci. Comput. 38, A2851\u2013A2879 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"271_CR58","doi-asserted-by":"publisher","first-page":"A1525","DOI":"10.1137\/130934805","volume":"36","author":"N Petra","year":"2014","unstructured":"Petra, N., Martin, J., Stadler, G., Ghattas, O.: A computational framework for infinite-dimensional Bayesian inverse problems, part ii: Stochastic Newton MCMC with application to ice sheet flow inverse problems. SIAM J. Sci. Comput. 36, A1525\u2013A1555 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"271_CR59","doi-asserted-by":"publisher","first-page":"5096","DOI":"10.1109\/TIT.2015.2450722","volume":"61","author":"M Pilanci","year":"2015","unstructured":"Pilanci, M., Wainwright, M.J.: Randomized sketches of convex programs with sharp guarantees. IEEE Trans. Inf. Theory 61, 5096\u20135115 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"271_CR60","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01584660","volume":"4","author":"MJ Powell","year":"1973","unstructured":"Powell, M.J.: On search directions for minimization algorithms. Math. Program. 4, 193\u2013201 (1973)","journal-title":"Math. Program."},{"key":"271_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1c, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144, 1\u201338 (2014)","journal-title":"Math. Program."},{"key":"271_CR62","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. JMLR 14, 567\u2013599 (2013)","journal-title":"JMLR"},{"key":"271_CR63","first-page":"1257","volume":"18","author":"E Snelson","year":"2006","unstructured":"Snelson, E., Ghahramani, Z.: Sparse Gaussian processes using pseudo-inputs. NIPS 18, 1257\u20131264 (2006)","journal-title":"NIPS"},{"key":"271_CR64","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"F Solis","year":"1981","unstructured":"Solis, F., Wets, R.J.-B.: Minimization by random search techniques. Math. Oper. Res. 6, 19\u201330 (1981)","journal-title":"Math. Oper. Res."},{"key":"271_CR65","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1137\/110853613","volume":"23","author":"SU Stich","year":"2013","unstructured":"Stich, S.U., Muller, C., Gartner, B.: Optimization of convex functions with random pursuit. SIAM J. Optim. 23, 1284\u20131309 (2013)","journal-title":"SIAM J. Optim."},{"key":"271_CR66","unstructured":"Titsias, M.: Variational learning of inducing variables in sparse Gaussian processes. In: AISTATS, pp.\u00a0567\u2013574 (2009)"},{"key":"271_CR67","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1137\/080727890","volume":"31","author":"Q Wang","year":"2009","unstructured":"Wang, Q., Moin, P., Iaccarino, G.: Minimal repetition dynamic checkpointing algorithm for unsteady adjoint calculation. SIAM J. Sci. Comput. 31, 2549\u20132567 (2009)","journal-title":"SIAM J. Sci. Comput."},{"key":"271_CR68","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1137\/0111043","volume":"11","author":"J Warga","year":"1963","unstructured":"Warga, J.: Minimizing certain convex functions. J. Soc. Ind. Appl. Math. 11, 588\u2013593 (1963)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"271_CR69","volume-title":"Gaussian Processes for Machine Learning","author":"CK Williams","year":"2006","unstructured":"Williams, C.K., Rasmussen, C.E.: Gaussian Processes for Machine Learning, vol. 2. MIT Press, Cambridge (2006)"},{"key":"271_CR70","first-page":"682","volume":"14","author":"CK Williams","year":"2001","unstructured":"Williams, C.K., Seeger, M.: Using the Nystr\u00f6m method to speed up kernel machines. NIPS 14, 682\u2013688 (2001)","journal-title":"NIPS"},{"key":"271_CR71","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00271-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00271-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00271-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T11:05:53Z","timestamp":1675163153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00271-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,13]]},"references-count":71,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["271"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00271-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,13]]},"assertion":[{"value":"19 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}