{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:42:37Z","timestamp":1776847357614,"version":"3.51.2"},"reference-count":89,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100014364","name":"Samsung Science and Technology Foundation","doi-asserted-by":"publisher","award":["SSTF-BA2101-02"],"award-info":[{"award-number":["SSTF-BA2101-02"]}],"id":[{"id":"10.13039\/501100014364","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10107-023-01973-1","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T12:03:24Z","timestamp":1686139404000},"page":"567-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods"],"prefix":"10.1007","volume":"204","author":[{"given":"Shuvomoy","family":"Das Gupta","sequence":"first","affiliation":[]},{"given":"Bart P. G.","family":"Van Parys","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6820-9095","authenticated-orcid":false,"given":"Ernest K.","family":"Ryu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"issue":"6","key":"1973_CR1","doi-asserted-by":"crossref","first-page":"1649","DOI":"10.1007\/s11590-021-01821-1","volume":"16","author":"H Abbaszadehpeivasti","year":"2022","unstructured":"Abbaszadehpeivasti, H., de Klerk, E., Zamani, M.: The exact worst-case convergence rate of the gradient method with fixed step lengths for $$l$$-smooth functions. Optim. Lett. 16(6), 1649\u20131661 (2022)","journal-title":"Optim. Lett."},{"key":"1973_CR2","unstructured":"Achterberg, T.: Non-convex MIQCP in Gurobi 9.1: new advances (2020). https:\/\/cdn.gurobi.com\/wp-content\/uploads\/2020\/12\/Non-Convex-MIQCP-in-Gurobi-9.1-New-Advances.pdf"},{"key":"1973_CR3","unstructured":"Achterberg, T., Towle, E.: Non-convex quadratic optimization: Gurobi 9.0 (2020). https:\/\/www.gurobi.com\/resource\/non-convex-quadratic-optimization\/"},{"key":"1973_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01903-7","author":"M Barr\u00e9","year":"2022","unstructured":"Barr\u00e9, M., Taylor, A.B., Bach, F.: Principled analyses and design of first-order methods with inexact proximal operators. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01903-7","journal-title":"Math. Program."},{"key":"1973_CR5","unstructured":"Barr\u00e9, M., Taylor, A., d\u2019Aspremont, A.: Complexity guarantees for Polyak steps with momentum. In: Conference on Learning Theory (2020)"},{"issue":"1\u20132","key":"1973_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-020-01500-6","volume":"189","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Moursi, W.M., Wang, X.: Generalized monotone operators and their averaged resolvents. Math. Program. 189(1\u20132), 55\u201374 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"1973_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1973_CR8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-002-0350-x","volume":"95","author":"HY Benson","year":"2003","unstructured":"Benson, H.Y., Vanderbei, R.J.: Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming. Math. Program. 95(2), 279\u2013302 (2003)","journal-title":"Math. Program."},{"key":"1973_CR9","volume-title":"Machine Learning Under a Modern Optimization Lens","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Dunn, J.: Machine Learning Under a Modern Optimization Lens. Dynamic Ideas LLC, Waltham (2019)"},{"key":"1973_CR10","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization, vol. 6. Athena Scientific, Belmont (1997)"},{"key":"1973_CR11","volume-title":"Optimization Over Integers","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., Weismantel, R.: Optimization Over Integers, vol. 13. Dynamic Ideas, Belmont (2005)"},{"key":"1973_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex Analysis and Nonlinear Optimization","author":"J Borwein","year":"2006","unstructured":"Borwein, J., Lewis, A.S.: Convex Analysis and Nonlinear Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"1973_CR13","doi-asserted-by":"crossref","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":"1973_CR14","first-page":"1997","volume":"37\u201356","author":"RH Byrd","year":"1997","unstructured":"Byrd, R.H., Liu, G., Nocedal, J.: On the local behavior of an interior point method for nonlinear programming. Numer. Anal. 37\u201356, 1997 (1997)","journal-title":"Numer. Anal."},{"key":"1973_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-Scale Nonlinear Optimization","author":"RH Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: an integrated package for nonlinear optimization. In: Pillo, G.D., Roma, M. (eds.) Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer, Berlin (2006)"},{"issue":"5","key":"1973_CR16","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Fourier Anal. Appl. 14(5), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"1973_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)"},{"key":"1973_CR18","doi-asserted-by":"crossref","unstructured":"Cyrus, S., Hu, B., Van Scoy, B., Lessard, L.: A robust accelerated optimization algorithm for strongly convex functions. In: American Control Conference (2018)","DOI":"10.23919\/ACC.2018.8430824"},{"key":"1973_CR19","doi-asserted-by":"crossref","unstructured":"Das Gupta, S., Freund, R.M., Sun, X.A., Taylor, A.B.: Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses. arXiv preprint arXiv:2301.01530 (2023)","DOI":"10.1007\/s10107-024-02127-7"},{"key":"1973_CR20","doi-asserted-by":"crossref","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. arXiv preprint arXiv:1803.06523 (2018)","DOI":"10.1137\/18M1178244"},{"key":"1973_CR21","doi-asserted-by":"crossref","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic subgradient method converges at the rate $$o(k^{-1\/4})$$ on weakly convex functions. arXiv preprint arXiv:1802.02988 (2018)","DOI":"10.1007\/s10208-018-09409-5"},{"issue":"1","key":"1973_CR22","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"1973_CR23","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1007\/s11590-016-1087-4","volume":"11","author":"E de Klerk","year":"2017","unstructured":"de Klerk, E., Glineur, F., Taylor, A.B.: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11(7), 1185\u20131199 (2017)","journal-title":"Optim. Lett."},{"issue":"3","key":"1973_CR24","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1137\/19M1281368","volume":"30","author":"E de Klerk","year":"2020","unstructured":"de Klerk, E., Glineur, F., Taylor, A.B.: Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation. SIAM J. Optim. 30(3), 2053\u20132082 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1973_CR25","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-021-01618-1","volume":"194","author":"R-A Dragomir","year":"2022","unstructured":"Dragomir, R.-A., Taylor, A.B., d\u2019Aspremont, A., Bolte, J.: Optimal complexity and certification of Bregman first-order methods. Math. Program. 194(1\u20132), 41\u201383 (2022)","journal-title":"Math. Program."},{"key":"1973_CR26","unstructured":"Drori, Y.: Contributions to the complexity analysis of optimization algorithms. Ph.D. thesis, Tel-Aviv University, Tel Aviv (2014)"},{"key":"1973_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jco.2016.11.001","volume":"39","author":"Y Drori","year":"2017","unstructured":"Drori, Y.: The exact information-based complexity of smooth convex minimization. J. Complex. 39, 1\u201316 (2017)","journal-title":"J. Complex."},{"key":"1973_CR28","unstructured":"Drori, Y., Shamir, O.: The complexity of finding stationary points with stochastic gradient descent. In: International Conference on Machine Learning (2020)"},{"issue":"1","key":"1973_CR29","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-019-01410-2","volume":"184","author":"Y Drori","year":"2020","unstructured":"Drori, Y., Taylor, A.B.: Efficient first-order methods for convex minimization: a constructive approach. Math. Program. 184(1), 183\u2013220 (2020)","journal-title":"Math. Program."},{"key":"1973_CR30","doi-asserted-by":"crossref","DOI":"10.1016\/j.jco.2021.101590","volume":"68","author":"Y Drori","year":"2022","unstructured":"Drori, Y., Taylor, A.B.: On the oracle complexity of smooth strongly convex minimization. J. Complex. 68, 101590 (2022)","journal-title":"J. Complex."},{"issue":"1\u20132","key":"1973_CR31","doi-asserted-by":"crossref","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(1\u20132), 451\u2013482 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1973_CR32","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"key":"1973_CR33","unstructured":"Fazel, M., Hindi, H., Boyd, S.: Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. In: American Control Conference (2003)"},{"key":"1973_CR34","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"AV Fiacco","year":"1990","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. SIAM, Philadelphia (1990)"},{"key":"1973_CR35","unstructured":"Gurobi 10: new advances (2021). https:\/\/www.gurobi.com\/products\/gurobi-optimizer\/whats-new-current-release\/"},{"key":"1973_CR36","unstructured":"Goujaud, B., Scieur, D., Dieuleveut, A., Taylor, A.B., Pedregosa, F.: Super-acceleration with cyclical step-sizes. In: International Conference on Artificial Intelligence and Statistics (2022)"},{"issue":"3","key":"1973_CR37","doi-asserted-by":"crossref","first-page":"1905","DOI":"10.1137\/19M1299049","volume":"30","author":"G Gu","year":"2020","unstructured":"Gu, G., Yang, J.: Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems. SIAM J. Optim. 30(3), 1905\u20131921 (2020)","journal-title":"SIAM J. Optim."},{"key":"1973_CR38","volume-title":"Statistical Learning with Sparsity: The Lasso and Generalizations","author":"T Hastie","year":"2019","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical Learning with Sparsity: The Lasso and Generalizations. Chapman and Hall\/CRC, London (2019)"},{"key":"1973_CR39","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia (2002)"},{"key":"1973_CR40","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"key":"1973_CR41","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (2013)"},{"issue":"1\u20132","key":"1973_CR42","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-021-01643-0","volume":"190","author":"D Kim","year":"2021","unstructured":"Kim, D.: Accelerated proximal point method for maximally monotone operators. Math. Program. 190(1\u20132), 57\u201387 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"1973_CR43","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10107-015-0949-3","volume":"159","author":"D Kim","year":"2016","unstructured":"Kim, D., Fessler, J.A.: Optimized first-order methods for smooth convex minimization. Math. Program. 159(1), 81\u2013107 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1973_CR44","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/16M108940X","volume":"28","author":"D Kim","year":"2018","unstructured":"Kim, D., Fessler, J.A.: Another look at the fast iterative shrinkage\/thresholding algorithm (FISTA). SIAM J. Optim. 28(1), 223\u2013250 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1973_CR45","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/s10957-020-01770-2","volume":"188","author":"D Kim","year":"2021","unstructured":"Kim, D., Fessler, J.A.: Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions. J. Optim. Theory Appl. 188(1), 192\u2013219 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"1973_CR46","unstructured":"Kozma, L.: Useful inequalities (2021). https:\/\/www.lkozma.net\/inequalities_cheat_sheet\/ineq.pdf"},{"key":"1973_CR47","first-page":"11999","volume":"34","author":"J Lee","year":"2021","unstructured":"Lee, J., Park, C., Ryu, E.K.: A geometric structure of acceleration and its role in making gradients small fast. Neural Inf. Process. Syst. 34, 11999\u201312012 (2021)","journal-title":"Neural Inf. Process. Syst."},{"key":"1973_CR48","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1287\/ijoc.2021.1067","volume":"34","author":"B Legat","year":"2021","unstructured":"Legat, B., Dowson, O., Garcia, J.D., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems. INFORMS J. Comput. 34, 672\u2013689 (2021)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1973_CR49","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/15M1009597","volume":"26","author":"L Lessard","year":"2016","unstructured":"Lessard, L., Recht, B., Packard, A.: Analysis and design of optimization algorithms via integral quadratic constraints. SIAM J. Optim. 26(1), 57\u201395 (2016)","journal-title":"SIAM J. Optim."},{"key":"1973_CR50","volume-title":"Introduction to Global Optimization","author":"L Liberti","year":"2008","unstructured":"Liberti, L.: Introduction to Global Optimization. Ecole Polytechnique, Palaiseau (2008)"},{"issue":"2","key":"1973_CR51","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s11590-020-01617-9","volume":"15","author":"F Lieder","year":"2021","unstructured":"Lieder, F.: On the convergence rate of the Halpern-iteration. Optim. Lett. 15(2), 405\u2013418 (2021)","journal-title":"Optim. Lett."},{"key":"1973_CR52","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611972672","volume-title":"Global Optimization: Theory, Algorithms, and Applications","author":"M Locatelli","year":"2013","unstructured":"Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms, and Applications. SIAM, Philadelphia (2013)"},{"issue":"3","key":"1973_CR53","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"Z-Q Luo","year":"2010","unstructured":"Luo, Z.-Q., Ma, W.-K., So, A.M.-C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27(3), 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"1973_CR54","unstructured":"Lyapunov, A.M.: The general problem of the stability of motion. Communications of the Mathematical Society of Kharkov (1892)"},{"issue":"1","key":"1973_CR55","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"1973_CR56","volume-title":"Variational Analysis and Generalized Differentiation I: Basic Theory","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I: Basic Theory. Springer, Berlin (2006)"},{"key":"1973_CR57","unstructured":"MOSEK ApS. MOSEK Optimizer API for C 9.3.6 (2019)"},{"key":"1973_CR58","unstructured":"Nemirovski, A.: Information-based complexity of convex programming. In: Lecture Notes, Technion\u2014Israel Institute of Technology (1995)"},{"issue":"2","key":"1973_CR59","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0885-064X(92)90013-2","volume":"8","author":"A Nemirovsky","year":"1992","unstructured":"Nemirovsky, A.: Information-based complexity of linear operator equations. J. Complex. 8(2), 153\u2013175 (1992)","journal-title":"J. Complex."},{"issue":"2","key":"1973_CR60","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^2)$$. Sov. Math. Dokl. 27(2), 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"1973_CR61","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, vol. 137, 2nd edn. Springer, Berlin (2018)","edition":"2"},{"issue":"1","key":"1973_CR62","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1), 139\u2013172 (1989)","journal-title":"Math. Program."},{"key":"1973_CR63","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2102.07366","author":"C Park","year":"2023","unstructured":"Park, C., Park, J., Ryu, E.K.: Factor-$$\\sqrt{2}$$ acceleration of accelerated gradient methods. Appl. Math. Optim. (2023). https:\/\/doi.org\/10.48550\/arXiv.2102.07366","journal-title":"Appl. Math. Optim."},{"key":"1973_CR64","unstructured":"Park, C., Ryu, E.K.: Optimal first-order algorithms as a function of inequalities. arXiv preprint arXiv:2110.11035 (2021)"},{"key":"1973_CR65","unstructured":"Park, J., Ryu, E.K.: Exact optimal accelerated complexity for fixed-point iterations. In: International Conference on Machine Learning (2022)"},{"key":"1973_CR66","unstructured":"Pedregosa, F.: On the link between optimization and polynomials: acceleration without Momentum (2021). http:\/\/fa.bianp.net\/blog\/2021\/no-momentum\/"},{"key":"1973_CR67","doi-asserted-by":"crossref","unstructured":"Reuther, A., Kepner, J., Byun, C., Samsi, S., Arcand, W., Bestor, D., Bergeron, B., Gadepally, V., Houle, M., Hubbell, M., Jones, M., Klein, A., Milechin, L., Mullen, J., Prout, A., Rosa, A., Yee, C., Michaleas, P.: Interactive supercomputing on 40,000 cores for machine learning and data analysis. In: 2018 IEEE High Performance extreme Computing Conference (HPEC), pp. 1\u20136. IEEE (2018)","DOI":"10.1109\/HPEC.2018.8547629"},{"issue":"5","key":"1973_CR68","first-page":"897","volume":"22","author":"RT Rockafellar","year":"2021","unstructured":"Rockafellar, R.T.: Characterizing firm nonexpansiveness of prox mappings both locally and globally. J. Nonlinear Convex Anal. 22(5), 897\u2013899 (2021)","journal-title":"J. Nonlinear Convex Anal."},{"key":"1973_CR69","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (2009)"},{"issue":"3","key":"1973_CR70","doi-asserted-by":"crossref","first-page":"2251","DOI":"10.1137\/19M1304854","volume":"30","author":"EK Ryu","year":"2020","unstructured":"Ryu, E.K., Taylor, A.B., Bergeling, C., Giselsson, P.: Operator splitting performance estimation: tight contraction factors and optimal parameter selection. SIAM J. Optim. 30(3), 2251\u20132271 (2020)","journal-title":"SIAM J. Optim."},{"key":"1973_CR71","doi-asserted-by":"crossref","DOI":"10.1017\/9781009160865","volume-title":"Large-Scale Convex Optimization via Monotone Operators","author":"EK Ryu","year":"2022","unstructured":"Ryu, E.K., Yin, W.: Large-Scale Convex Optimization via Monotone Operators. Cambridge University Press, Cambridge (2022)"},{"issue":"3","key":"1973_CR72","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"1973_CR73","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22(1), 233\u2013261 (2002)","journal-title":"J. Glob. Optim."},{"key":"1973_CR74","doi-asserted-by":"crossref","unstructured":"Shi, Z., Liu, R.: Better worst-case complexity analysis of the block coordinate descent method for large scale machine learning. In: International Conference on Machine Learning and Applications (2017)","DOI":"10.1109\/ICMLA.2017.00-43"},{"key":"1973_CR75","unstructured":"Taylor, A.B.: Convex interpolation and performance estimation of first-order methods for convex optimization. Ph.D. thesis, Catholic University of Louvain, Louvain-la-Neuve (2017)"},{"key":"1973_CR76","unstructured":"Taylor, A.B.: Computer-aided analyses in optimization. (2020) https:\/\/francisbach.com\/computer-aided-analyses\/"},{"key":"1973_CR77","unstructured":"Taylor, A.B., Bach, F.: Stochastic first-order methods: non-asymptotic and computer-aided analyses via potential functions. In: Conference on Learning Theory (2019)"},{"key":"1973_CR78","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01839-y","author":"AB Taylor","year":"2022","unstructured":"Taylor, A.B., Drori, Y.: An optimal gradient method for smooth strongly convex minimization. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01839-y","journal-title":"Math. Program."},{"issue":"3","key":"1973_CR79","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1137\/16M108104X","volume":"27","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case performance of first-order methods for composite convex optimization. SIAM J. Optim. 27(3), 1283\u20131313 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1973_CR80","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-016-1009-3","volume":"161","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Program. 161(1\u20132), 307\u2013345 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"1973_CR81","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10957-018-1298-1","volume":"178","author":"AB Taylor","year":"2018","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case convergence rates of the proximal gradient method for composite convex minimization. J. Optim. Theory Appl. 178(2), 455\u2013476 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"1973_CR82","unstructured":"Taylor, A.B., Van Scoy, B., Lessard, L.: Lyapunov functions for first-order methods: tight automated convergence guarantees. In: International Conference on Machine Learning (2018)"},{"key":"1973_CR83","unstructured":"Tran-Dinh, Q.: The connection between Nesterov\u2019s accelerated methods and Halpern fixed-point iterations. arXiv preprint arXiv:2203.04869 (2022)"},{"issue":"1","key":"1973_CR84","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/LCSYS.2017.2722406","volume":"2","author":"B Van Scoy","year":"2017","unstructured":"Van Scoy, B., Freeman, R.A., Lynch, K.M.: The fastest known globally convergent first-order method for minimizing strongly convex functions. IEEE Control Syst. Lett. 2(1), 49\u201354 (2017)","journal-title":"IEEE Control Syst. Lett."},{"issue":"1","key":"1973_CR85","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"1973_CR86","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/S1052623403426544","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: local convergence. SIAM J. Optim. 16(1), 32\u201348 (2005)","journal-title":"SIAM J. Optim."},{"key":"1973_CR87","unstructured":"Yoon, T., Ryu, E.K.: Accelerated algorithms for smooth convex-concave minimax problems with $$\\cal{O}(1\/k^2)$$ rate on squared gradient norm. In: International Conference on Machine Learning (2021)"},{"issue":"1\u20134","key":"1973_CR88","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/sapm1953321243","volume":"32","author":"D Young","year":"1953","unstructured":"Young, D.: On Richardson\u2019s method for solving linear systems with positive definite matrices. J. Math. Phys. 32(1\u20134), 243\u2013255 (1953)","journal-title":"J. Math. Phys."},{"key":"1973_CR89","unstructured":"Zhou, K., Tian, L., So, A.M.-C., Cheng, J.: Practical schemes for finding near-stationary points of convex finite-sums. In: International Conference on Artificial Intelligence and Statistics (2022)"}],"updated-by":[{"DOI":"10.1007\/s10107-023-01998-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000}}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01973-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01973-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01973-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T22:21:42Z","timestamp":1729549302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01973-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":89,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1973"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01973-1","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10107-023-01998-6","asserted-by":"object"}]},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"27 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10107-023-01998-6","URL":"https:\/\/doi.org\/10.1007\/s10107-023-01998-6","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}