{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:14:46Z","timestamp":1725804886668},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319107615"},{"type":"electronic","value":"9783319107622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10762-2_13","type":"book-chapter","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T10:58:55Z","timestamp":1410346735000},"page":"130-140","source":"Crossref","is-referenced-by-count":1,"title":["On Low Complexity Acceleration Techniques for Randomized Optimization"],"prefix":"10.1007","author":[{"given":"Sebastian Urban","family":"Stich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Polyak, B.: Introduction to Optimization. Optimization Software - Inc. (1987)","key":"13_CR1"},{"doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer (2004)","key":"13_CR2","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"C.G. Broyden","year":"1970","unstructured":"Broyden, C.G.: The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations. IMA J. of Appl. Math.\u00a06(1), 76\u201390 (1970)","journal-title":"IMA J. of Appl. Math."},{"issue":"3","key":"13_CR4","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. The Computer Journal\u00a013(3), 317\u2013322 (1970)","journal-title":"The Computer Journal"},{"issue":"109","key":"13_CR5","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. Mathematics of Computation\u00a024(109), 23\u201326 (1970)","journal-title":"Mathematics of Computation"},{"issue":"151","key":"13_CR6","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J. Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating Quasi-Newton Matrices with Limited Storage. Mathematics of Computation\u00a035(151), 773\u2013782 (1980)","journal-title":"Mathematics of Computation"},{"issue":"1-3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D.C. Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Mathematical Programming\u00a045(1-3), 503\u2013528 (1989)","journal-title":"Mathematical Programming"},{"issue":"2","key":"13_CR8","first-page":"372","volume":"27","author":"Y. Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate O(1\/k\n                  2). Soviet Mathematics Doklady\u00a027(2), 372\u2013376 (1983)","journal-title":"Soviet Mathematics Doklady"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-006-0001-8","volume":"110","author":"Y. Nesterov","year":"2007","unstructured":"Nesterov, Y.: Smoothing technique and its applications in semidefinite optimization. Mathematical Programming\u00a0110(2), 245\u2013259 (2007)","journal-title":"Mathematical Programming"},{"unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM Journal on Optimization (2008)","key":"13_CR10"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"M. Schumer","year":"1968","unstructured":"Schumer, M., Steiglitz, K.: Adaptive step size random search. IEEE Transactions on Automatic Control\u00a013(3), 270\u2013276 (1968)","journal-title":"IEEE Transactions on Automatic Control"},{"unstructured":"Rechenberg, I.: Evolutionsstrategie; Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog (1973)","key":"13_CR12"},{"key":"13_CR13","first-page":"82","volume":"1","author":"V.A. Mutseniyeks","year":"1964","unstructured":"Mutseniyeks, V.A., Rastrigin, L.A.: Extremal control of continuous multi-parameter systems by the method of random search. Eng.Cyb.\u00a01, 82\u201390 (1964)","journal-title":"Eng.Cyb."},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1137\/110853613","volume":"23","author":"S.U. Stich","year":"2013","unstructured":"Stich, S.U., M\u00fcller, C.L., G\u00e4rtner, B.: Optimization of convex functions with Random Pursuit. SIAM Journal on Optimization\u00a023(2), 1284\u20131309 (2013)","journal-title":"SIAM Journal on Optimization"},{"unstructured":"Nesterov, Y.: Random Gradient-Free Minimization of Convex Functions. Technical report, ECORE (2011)","key":"13_CR15"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/02331930903100141","volume":"60","author":"D. Leventhal","year":"2011","unstructured":"Leventhal, D., Lewis, A.S.: Randomized Hessian estimation and directional search. Optimization\u00a060(3), 329\u2013345 (2011)","journal-title":"Optimization"},{"unstructured":"Stich, S.U., G\u00e4rtner, B., M\u00fcller, C.L.: Variable Metric Random Pursuit (2012) (submitted), \n                    \n                      http:\/\/arxiv.org\/abs\/1210.5114","key":"13_CR17"},{"issue":"2","key":"13_CR18","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-Adaption in Evolution Strategies. Evolutionary Computation\u00a09(2), 159\u2013195 (2001)","journal-title":"Evolutionary Computation"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N. Hansen","year":"2003","unstructured":"Hansen, N., Muller, S.D., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput.\u00a011(1), 1\u201318 (2003)","journal-title":"Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"Knight, J.N., Lunacek, M.: Reducing the Space-time Complexity of the CMA-ES. In: GECCO 2007, pp. 658\u2013665. ACM (2007)","key":"13_CR20","DOI":"10.1145\/1276958.1277097"},{"unstructured":"Loshchilov, I.: A Computationally Efficient Limited Memory CMA-ES for Large Scale Optimization. To appear GECCO (2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1404.5520","key":"13_CR21"},{"doi-asserted-by":"crossref","unstructured":"Lee, Y.T., Sidford, A.: Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems. In: FOCS, pp. 147\u2013156. IEEE (2013)","key":"13_CR22","DOI":"10.1109\/FOCS.2013.24"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-58484-6_263","volume-title":"Parallel Problem Solving from Nature - PPSN III","author":"A. Ostermeier","year":"1994","unstructured":"Ostermeier, A., Gawelczyk, A., Hansen, N.: Step-size adaptation based on non-local use of selection information. In: Davidor, Y., M\u00e4nner, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol.\u00a0866, pp. 189\u2013198. Springer, Heidelberg (1994)"},{"doi-asserted-by":"crossref","unstructured":"Igel, C., Suttorp, T., Hansen, N.: A Computational Efficient Covariance Matrix Update and a (1+1)-CMA for Evolution Strategies. In: GECCO, pp. 453\u2013460 (2006)","key":"13_CR24","DOI":"10.1145\/1143997.1144082"},{"doi-asserted-by":"crossref","unstructured":"Sun, Y., Schaul, T., Gomez, F., Schmidhuber, J.: A linear time natural evolution strategy for non-separable functions. In: Proc. 15th Genetic and Evolutionary Computation Conference Companion, pp. 61\u201362. ACM (2013)","key":"13_CR25","DOI":"10.1145\/2464576.2464608"},{"unstructured":"Stich, S.U.: Supplementary Online Mat (2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1406.2010","key":"13_CR26"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-642-32937-1_45","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"S.U. Stich","year":"2012","unstructured":"Stich, S.U., M\u00fcller, C.L.: On Spectral Invariance of Randomized Hessian and Covariance Matrix Adaptation Schemes. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part I. LNCS, vol.\u00a07491, pp. 448\u2013457. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10762-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:38:36Z","timestamp":1558978716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10762-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319107615","9783319107622"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10762-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}