{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T20:25:18Z","timestamp":1776716718250,"version":"3.51.2"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T00:00:00Z","timestamp":1700697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T00:00:00Z","timestamp":1700697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["416229255"],"award-info":[{"award-number":["416229255"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["416229255"],"award-info":[{"award-number":["416229255"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001652","name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001652","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this contribution, we present a full overview of the<jats:italic>continuous stochastic gradient<\/jats:italic>(CSG) method, including convergence results, step size rules and algorithmic insights. We consider optimization problems in which the objective function requires some form of integration, e.g., expected values. Since approximating the integration by a fixed quadrature rule can introduce artificial local solutions into the problem while simultaneously raising the computational effort, stochastic optimization schemes have become increasingly popular in such contexts. However, known stochastic gradient type methods are typically limited to expected risk functions and inherently require many iterations. The latter is particularly problematic, if the evaluation of the cost function involves solving multiple state equations, given, e.g., in form of partial differential equations. To overcome these drawbacks, a recent article introduced the CSG method, which reuses old gradient sample information via the calculation of design dependent integration weights to obtain a better approximation to the full gradient. While in the original CSG paper convergence of a subsequence was established for a diminishing step size, here, we provide a complete convergence analysis of CSG for constant step sizes and an Armijo-type line search. Moreover, new methods to obtain the integration weights are presented, extending the application range of CSG to problems involving higher dimensional integrals and distributed data.<\/jats:p>","DOI":"10.1007\/s10589-023-00542-8","type":"journal-article","created":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T10:02:23Z","timestamp":1700733743000},"page":"935-976","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The continuous stochastic gradient method: part I\u2013convergence theory"],"prefix":"10.1007","volume":"87","author":[{"given":"Max","family":"Grieshammer","sequence":"first","affiliation":[]},{"given":"Lukas","family":"Pflug","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Stingl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0650-3747","authenticated-orcid":false,"given":"Andrian","family":"Uihlein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,23]]},"reference":[{"issue":"6","key":"542_CR1","doi-asserted-by":"publisher","first-page":"2595","DOI":"10.1007\/s00158-020-02571-x","volume":"61","author":"L Pflug","year":"2020","unstructured":"Pflug, L., Bernhardt, N., Grieshammer, M., Stingl, M.: CSG: a new stochastic gradient method for the efficient solution of structural optimization problems with infinitely many states. Struct. Multidiscip. Optim. 61(6), 2595\u20132611 (2020). https:\/\/doi.org\/10.1007\/s00158-020-02571-x","journal-title":"Struct. Multidiscip. Optim."},{"key":"542_CR2","doi-asserted-by":"publisher","first-page":"114158-32","DOI":"10.1016\/j.cma.2021.114158","volume":"387","author":"C Kim","year":"2021","unstructured":"Kim, C., Lee, J., Yoo, J.: Machine learning-combined topology optimization for functionary graded composite structure design. Comput. Methods Appl. Mech. Eng. 387, 114158\u201332 (2021). https:\/\/doi.org\/10.1016\/j.cma.2021.114158","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"542_CR3","doi-asserted-by":"publisher","first-page":"110394","DOI":"10.1016\/j.jcp.2021.110394","volume":"440","author":"EG Evstatiev","year":"2021","unstructured":"Evstatiev, E.G., Finn, J.M., Shadwick, B.A., Hengartner, N.: Noise and error analysis and optimization in particle-based kinetic plasma simulations. J. Comput. Phys. 440, 110394\u201328 (2021). https:\/\/doi.org\/10.1016\/j.jcp.2021.110394","journal-title":"J. Comput. Phys."},{"issue":"1\u20133","key":"542_CR4","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.cma.2006.05.005","volume":"196","author":"E Wadbro","year":"2006","unstructured":"Wadbro, E., Berggren, M.: Topology optimization of an acoustic horn. Comput. Methods Appl. Mech. Eng. 196(1\u20133), 420\u2013436 (2006). https:\/\/doi.org\/10.1016\/j.cma.2006.05.005","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"5","key":"542_CR5","doi-asserted-by":"publisher","first-page":"2488","DOI":"10.1109\/TAP.2014.2309112","volume":"62","author":"E Hassan","year":"2014","unstructured":"Hassan, E., Wadbro, E., Berggren, M.: Topology optimization of metallic antennas. IEEE Trans. Antennas Propag. 62(5), 2488\u20132500 (2014). https:\/\/doi.org\/10.1109\/TAP.2014.2309112","journal-title":"IEEE Trans. Antennas Propag."},{"key":"542_CR6","doi-asserted-by":"publisher","unstructured":"Semmler, J., Pflug, L., Stingl, M., Leugering, G.: Shape optimization in electromagnetic applications. In: New Trends in Shape Optimization. Internat. Ser. Numer. Math., vol. 166, pp. 251\u2013269. Birkh\u00e4user\/Springer, Cham ( 2015). https:\/\/doi.org\/10.1007\/978-3-319-17563-8_11","DOI":"10.1007\/978-3-319-17563-8_11"},{"issue":"6","key":"542_CR7","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1002\/nme.7168","volume":"124","author":"S Singh","year":"2023","unstructured":"Singh, S., Pflug, L., Mergheim, J., Stingl, M.: Robust design optimization for enhancing delamination resistance of composites. Internat. J. Numer. Methods Eng. 124(6), 1381\u20131404 (2023). https:\/\/doi.org\/10.1002\/nme.7168","journal-title":"Internat. J. Numer. Methods Eng."},{"issue":"3","key":"542_CR8","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/18M1224076","volume":"9","author":"M Martin","year":"2021","unstructured":"Martin, M., Nobile, F.: Pde-constrained optimal control problems with uncertain parameters using saga. SIAM\/ASA J. Uncertain. Quanti. 9(3), 979\u20131012 (2021). https:\/\/doi.org\/10.1137\/18M1224076","journal-title":"SIAM\/ASA J. Uncertain. Quanti."},{"issue":"3","key":"542_CR9","doi-asserted-by":"publisher","first-page":"2172","DOI":"10.1137\/070711311","volume":"31","author":"A Borz\u00ec","year":"2009","unstructured":"Borz\u00ec, A., von Winckel, G.: Multigrid methods and sparse-grid collocation techniques for parabolic optimal control problems with random coefficients. SIAM J. Sci. Comput. 31(3), 2172\u20132192 (2009). https:\/\/doi.org\/10.1137\/070711311","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"542_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/100786356","volume":"52","author":"I Babu\u0161ka","year":"2010","unstructured":"Babu\u0161ka, I., Nobile, F., Tempone, R.: A stochastic collocation method for elliptic partial differential equations with random input data. SIAM Rev. 52(2), 317\u2013355 (2010). https:\/\/doi.org\/10.1137\/100786356","journal-title":"SIAM Rev."},{"issue":"2","key":"542_CR11","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1137\/S0036142902418680","volume":"42","author":"I Babuska","year":"2004","unstructured":"Babuska, I., Tempone, R., Zouraris, G.E.: Galerkin finite element approximations of stochastic elliptic partial differential equations. SIAM J. Numer. Anal. 42(2), 800\u2013825 (2004). https:\/\/doi.org\/10.1137\/S0036142902418680","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"542_CR12","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1137\/18M1200208","volume":"29","author":"C Geiersbach","year":"2019","unstructured":"Geiersbach, C., Pflug, G.C.: Projected stochastic gradients for convex constrained problems in Hilbert spaces. SIAM J. Optim. 29(3), 2079\u20132099 (2019). https:\/\/doi.org\/10.1137\/18M1200208","journal-title":"SIAM J. Optim."},{"issue":"5","key":"542_CR13","doi-asserted-by":"publisher","first-page":"2750","DOI":"10.1137\/19M1263297","volume":"42","author":"C Geiersbach","year":"2020","unstructured":"Geiersbach, C., Wollner, W.: A stochastic gradient method with mesh refinement for pde-constrained optimization under uncertainty. SIAM J. Sci. Comput. 42(5), 2750\u20132772 (2020). https:\/\/doi.org\/10.1137\/19M1263297","journal-title":"SIAM J. Sci. Comput."},{"key":"542_CR14","doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research, p. 636. Springer, New York ( 1999). https:\/\/doi.org\/10.1007\/b98874","DOI":"10.1007\/b98874"},{"key":"542_CR15","doi-asserted-by":"publisher","unstructured":"Pflug, G.C., Pichler, A.: Multistage Stochastic Optimization. Springer Series in Operations Research and Financial Engineering, p. 301. Springer, Cham ( 2014). https:\/\/doi.org\/10.1007\/978-3-319-08843-3","DOI":"10.1007\/978-3-319-08843-3"},{"key":"542_CR16","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). https:\/\/doi.org\/10.1214\/aoms\/1177729586","journal-title":"Ann. Math. Stat."},{"issue":"1\u20132","key":"542_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1030-6","journal-title":"Math. Program."},{"key":"542_CR18","doi-asserted-by":"publisher","unstructured":"Curtis, F.E., O\u2019Neill, M.J., Robinson, D.P.: Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization. arXiv preprint arXiv:2112.14799 ( 2021). https:\/\/doi.org\/10.48550\/arXiv.2112.14799","DOI":"10.48550\/arXiv.2112.14799"},{"issue":"2","key":"542_CR19","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1137\/20M1354556","volume":"31","author":"AS Berahas","year":"2021","unstructured":"Berahas, A.S., Curtis, F.E., Robinson, D., Zhou, B.: Sequential quadratic optimization for nonlinear equality constrained stochastic optimization. SIAM J. Optim. 31(2), 1352\u20131379 (2021). https:\/\/doi.org\/10.1137\/20M1354556","journal-title":"SIAM J. Optim."},{"key":"542_CR20","first-page":"1737","volume":"10","author":"A Bordes","year":"2009","unstructured":"Bordes, A., Bottou, L., Gallinari, P.: SGD-QN: careful quasi-Newton stochastic gradient descent. J. Mach. Learn. Res. 10, 1737\u20131754 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"542_CR21","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/15M1021106","volume":"27","author":"M Pilanci","year":"2017","unstructured":"Pilanci, M., Wainwright, M.J.: Newton sketch: a near linear-time optimization algorithm with linear-quadratic convergence. SIAM J. Optim. 27(1), 205\u2013245 (2017). https:\/\/doi.org\/10.1137\/15M1021106","journal-title":"SIAM J. Optim."},{"issue":"2","key":"542_CR22","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). https:\/\/doi.org\/10.1137\/140954362","journal-title":"SIAM J. Optim."},{"key":"542_CR23","unstructured":"Moritz, P., Nishihara, R., Jordan, M.: A linearly-convergent stochastic l-bfgs algorithm. In: Artificial Intelligence and Statistics, pp. 249\u2013258 (2016). PMLR"},{"key":"542_CR24","doi-asserted-by":"publisher","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). https:\/\/doi.org\/10.48550\/arXiv.1412.6980","DOI":"10.48550\/arXiv.1412.6980"},{"key":"542_CR25","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., 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."},{"issue":"1\u20132","key":"542_CR26","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10107-016-1017-3","volume":"161","author":"M Wang","year":"2017","unstructured":"Wang, M., Fang, E.X., Liu, H.: Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions. Math. Program. 161(1\u20132), 419\u2013449 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1017-3","journal-title":"Math. Program."},{"key":"542_CR27","doi-asserted-by":"publisher","unstructured":"Grieshammer, P., Pflug, L., Stingl, M., Uihlein, A.: The continuous stochastic gradient method: part II\u2013application and numerics. Comput. Optim. Appl. (2023). https:\/\/doi.org\/10.1007\/s10589-023-00540-w","DOI":"10.1007\/s10589-023-00540-w"},{"key":"542_CR28","doi-asserted-by":"publisher","first-page":"3297","DOI":"10.1039\/C2CS15267C","volume":"41","author":"Y Zhao","year":"2012","unstructured":"Zhao, Y., Xie, Z., Gu, H., Zhu, C., Gu, Z.: Bio-inspired variable structural color materials. Chem. Soc. Rev. 41, 3297\u20133317 (2012). https:\/\/doi.org\/10.1039\/C2CS15267C","journal-title":"Chem. Soc. Rev."},{"key":"542_CR29","doi-asserted-by":"crossref","unstructured":"Wang, J., Sultan, U., Goerlitzer, E.S.A., Mbah, C.F., Engel, M.S., Vogel, N.: Structural color of colloidal clusters as a tool to investigate structure and dynamics. In: Advanced Functional Materials, vol. 30 (2019)","DOI":"10.1002\/adfm.201907730"},{"key":"542_CR30","doi-asserted-by":"publisher","DOI":"10.1002\/adma.201606876","author":"GT England","year":"2017","unstructured":"England, G.T., Russell, C., Shirman, E., Kay, T., Vogel, N., Aizenberg, J.: The optical Janus effect: asymmetric structural color reflection materials. Adv. Mater. (2017). https:\/\/doi.org\/10.1002\/adma.201606876","journal-title":"Adv. Mater."},{"issue":"9","key":"542_CR31","doi-asserted-by":"publisher","first-page":"1701151","DOI":"10.1126\/sciadv.1701151","volume":"3","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Hu, Z., Wang, Z., Li, Y., Tormo, A.D., Thomas, N.L., Wang, B., Gianneschi, N.C., Shawkey, M.D., Dhinojwala, A.: Bioinspired bright noniridescent photonic melanin supraballs. Sci. Adv. 3(9), 1701151 (2017). https:\/\/doi.org\/10.1126\/sciadv.1701151","journal-title":"Sci. Adv."},{"key":"542_CR32","doi-asserted-by":"publisher","unstructured":"Goerlitzer, E.S.A., Klupp\u00a0Taylor, R.N., Vogel, N.: Bioinspired photonic pigments from colloidal self-assembly. Adv. Mater. 30(28), 1706654 (2018). https:\/\/doi.org\/10.1002\/adma.201706654","DOI":"10.1002\/adma.201706654"},{"issue":"1","key":"542_CR33","doi-asserted-by":"publisher","first-page":"202200047","DOI":"10.1002\/pamm.202200047","volume":"22","author":"A Uihlein","year":"2023","unstructured":"Uihlein, A., Pflug, L., Stingl, M.: Optimizing color of particulate products. PAMM 22(1), 202200047 (2023). https:\/\/doi.org\/10.1002\/pamm.202200047","journal-title":"PAMM"},{"issue":"1","key":"542_CR34","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1115\/1.3653121","volume":"86","author":"HJ Kushner","year":"1964","unstructured":"Kushner, H.J.: A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise. J. Basic Eng. 86(1), 97\u2013106 (1964). https:\/\/doi.org\/10.1115\/1.3653121","journal-title":"J. Basic Eng."},{"key":"542_CR35","doi-asserted-by":"publisher","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. vol. 13, pp. 455\u2013492 (1998). https:\/\/doi.org\/10.1023\/A:1008306431147. Workshop on Global Optimization (Trier, 1997)","DOI":"10.1023\/A:1008306431147"},{"key":"542_CR36","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400378742","author":"C Audet","year":"2000","unstructured":"Audet, C., Dennis, J.: Analysis of generalized pattern searches. SIAM J. Optim. (2000). https:\/\/doi.org\/10.1137\/S1052623400378742","journal-title":"SIAM J. Optim."},{"key":"542_CR37","doi-asserted-by":"publisher","unstructured":"Klenke, A.: Probability Theory. Universitext, p. 616. Springer, London (2008). https:\/\/doi.org\/10.1007\/978-1-84800-048-3. A comprehensive course, Translated from the 2006 German original","DOI":"10.1007\/978-1-84800-048-3"},{"key":"542_CR38","unstructured":"Burrough, P., McDonnell, R., Lloyd, C.: 8.11 nearest neighbours: Thiessen (dirichlet\/voroni) polygons. Principles of Geographical Information Systems (2015)"},{"key":"542_CR39","doi-asserted-by":"crossref","unstructured":"Dudley, R.M.: Central limit theorems for empirical measures. Ann. Probab. (no. 6) 899\u20139291979 (1978)","DOI":"10.1214\/aop\/1176995384"},{"key":"542_CR40","first-page":"23","volume":"19","author":"VS Varadarajan","year":"1958","unstructured":"Varadarajan, V.S.: On the convergence of sample probability distributions. Sankhy\u0101 19, 23\u201326 (1958)","journal-title":"Sankhy\u0101"},{"key":"542_CR41","doi-asserted-by":"crossref","unstructured":"Folland, G.B.: A Guide to Advanced Real Analysis. The Dolciani Mathematical Expositions, vol. 37, p. 107. Mathematical Association of America, Washington DC (2009). MAA Guides, 2","DOI":"10.5948\/UPO9780883859155"},{"key":"542_CR42","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. Bull. Am. Math. Soc. 70, 709\u2013710 (1964). https:\/\/doi.org\/10.1090\/S0002-9904-1964-11178-2","journal-title":"Bull. Am. Math. Soc."},{"issue":"5","key":"542_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin, E.S., Polyak, B.T.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6(5), 1\u201350 (1966). https:\/\/doi.org\/10.1016\/0041-5553(66)90114-5","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"542_CR44","doi-asserted-by":"publisher","unstructured":"Beck, A.: First-order Methods in Optimization. MOS-SIAM Series on Optimization, vol. 25, p. 475. Society for Industrial and Applied Mathematics (SIAM); Mathematical Optimization Society, Philadelphia (2017). https:\/\/doi.org\/10.1137\/1.9781611974997.ch1","DOI":"10.1137\/1.9781611974997.ch1"},{"issue":"3","key":"542_CR45","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1111\/j.1751-5823.2002.tb00178.x","volume":"70","author":"AL Gibbs","year":"2002","unstructured":"Gibbs, A.L., Su, F.E.: On choosing and bounding probability metrics. Int. Stat. Rev. 70(3), 419\u2013435 (2002)","journal-title":"Int. Stat. Rev."},{"key":"542_CR46","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1090\/S0002-9904-1942-07811-6","volume":"48","author":"A Sard","year":"1942","unstructured":"Sard, A.: The measure of the critical values of differentiable maps. Bull. Am. Math. Soc. 48, 883\u2013890 (1942). https:\/\/doi.org\/10.1090\/S0002-9904-1942-07811-6","journal-title":"Bull. Am. Math. Soc."},{"key":"542_CR47","first-page":"222","volume-title":"Differential Topology","author":"V Guillemin","year":"1974","unstructured":"Guillemin, V., Pollack, A.: Differential Topology, p. 222. Prentice-Hall Inc, Englewood Cliffs (1974)"},{"issue":"4","key":"542_CR48","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1215\/S0012-7094-35-00138-7","volume":"1","author":"H Whitney","year":"1935","unstructured":"Whitney, H.: A function not constant on a connected set of critical points. Duke Math. J. 1(4), 514\u2013517 (1935). https:\/\/doi.org\/10.1215\/S0012-7094-35-00138-7","journal-title":"Duke Math. J."},{"issue":"4","key":"542_CR49","doi-asserted-by":"crossref","first-page":"593","DOI":"10.4310\/jdg\/1214435238","volume":"14","author":"R Kaufman","year":"1979","unstructured":"Kaufman, R.: A singular map of a cube onto a square. J. Differ. Geom. 14(4), 593\u2013594 (1979)","journal-title":"J. Differ. Geom."},{"key":"542_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16, 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"key":"542_CR51","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226\u2013235 (1969). https:\/\/doi.org\/10.1137\/1011036","journal-title":"SIAM Rev."},{"key":"542_CR52","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. II. Some corrections. SIAM Rev. 13, 185\u2013188 (1971). https:\/\/doi.org\/10.1137\/1013035","journal-title":"SIAM Rev."},{"issue":"2","key":"542_CR53","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(2), 223\u2013311 (2018). https:\/\/doi.org\/10.1137\/16M1080173","journal-title":"SIAM Rev."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00542-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00542-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00542-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T22:42:41Z","timestamp":1730587361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00542-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,23]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["542"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00542-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,23]]},"assertion":[{"value":"12 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}