{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T12:02:07Z","timestamp":1778155327764,"version":"3.51.4"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10107-022-01901-9","type":"journal-article","created":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T11:02:54Z","timestamp":1666177374000},"page":"133-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Faster first-order primal-dual methods for linear programming using restarts and sharpness"],"prefix":"10.1007","volume":"201","author":[{"given":"David","family":"Applegate","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5077-0359","authenticated-orcid":false,"given":"Oliver","family":"Hinder","sequence":"additional","affiliation":[]},{"given":"Haihao","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6781-9633","authenticated-orcid":false,"given":"Miles","family":"Lubin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"1901_CR1","unstructured":"Alacaoglu, A., Fercoq, O., Cevher, V.: On the convergence of stochastic primal-dual hybrid gradient, arXiv preprint arXiv:1911.00799 (2019)"},{"key":"1901_CR2","doi-asserted-by":"crossref","unstructured":"Alamo, T., Limon, D., Krupa, P.: Restart FISTA with global linear convergence. In: 18th European Control Conference (ECC). IEEE, vol. 2019, pp. 1969\u20131974 (2019)","DOI":"10.23919\/ECC.2019.8795831"},{"key":"1901_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, E.D., Andersen, K.D.: The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm. In: High Performance Optimization, pp.\u00a0197\u2013232. Springer (2000)","DOI":"10.1007\/978-1-4757-3216-0_8"},{"issue":"1","key":"1901_CR4","first-page":"40","volume":"18","author":"RI Anderson","year":"2000","unstructured":"Anderson, R.I., Fok, R., Scott, J.: Hotel industry efficiency: an advanced linear programming examination. Am. Bus. Rev. 18(1), 40 (2000)","journal-title":"Am. Bus. Rev."},{"key":"1901_CR5","unstructured":"Applegate, D., D\u00edaz, M., Hinder, O., Lu, H., Lubin, M., O\u2019Donoghue, B., Schudy, W.: Practical large-scale linear programming using primal-dual hybrid gradient. In: Advances in Neural Information Processing Systems, vol. 34 (2021)"},{"key":"1901_CR6","unstructured":"Applegate, D., D\u00edaz, M., Lu, H., Lubin, M.: Infeasibility detection with primal-dual hybrid gradient for large-scale linear programming, arXiv preprint arXiv:2102.04592 (2021)"},{"key":"1901_CR7","unstructured":"Basu, K., Ghoting, A., Mazumder, R., Pan, Y.: ECLIPSE: an extreme-scale linear program solver for web-applications. In: Daum\u00e9 III, H., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning (Virtual), Proceedings of Machine Learning Research, PMLR, vol. 119, pp. 704\u2013714 (2020)"},{"key":"1901_CR8","unstructured":"Basu, K., Ghoting, A., Mazumder, R., Pan, Y.: Eclipse: an extreme-scale linear program solver for web-applications. In: International Conference on Machine Learning, PMLR, pp.\u00a0704\u2013714 (2020)"},{"issue":"4","key":"1901_CR9","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1901_CR10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/opre.4.1.100","volume":"4","author":"EH Bowman","year":"1956","unstructured":"Bowman, E.H.: Production scheduling by the transportation method of linear programming. Oper. Res. 4(1), 100\u2013103 (1956)","journal-title":"Oper. Res."},{"issue":"1","key":"1901_CR11","first-page":"1","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et al.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends\u00ae Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends\u00ae Mach. Learn."},{"issue":"5","key":"1901_CR12","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1137\/0331063","volume":"31","author":"JV Burke","year":"1993","unstructured":"Burke, J.V., Ferris, M.C.: Weak sharp minima in mathematical programming. SIAM J. Control Optim. 31(5), 1340\u20131359 (1993)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"1901_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01585997","volume":"71","author":"VJ Burke","year":"1995","unstructured":"Burke, V.J., Ferris, M.C.: A Gauss-Newton method for convex composite optimization. Math. Program. 71(2), 179\u2013194 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"1901_CR14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"1\u20132","key":"1901_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1901_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/mnsc.1.1.49","volume":"1","author":"A Charnes","year":"1954","unstructured":"Charnes, A., Cooper, W.W.: The stepping stone method of explaining linear programming calculations in transportation problems. Manag. Sci. 1(1), 49\u201369 (1954)","journal-title":"Manag. Sci."},{"key":"1901_CR17","doi-asserted-by":"crossref","unstructured":"Condat, L., Malinovsky, G., Richt\u00e1rik, P.: Distributed proximal splitting algorithms with rates and acceleration. Front. Signal Process. 12 (2022)","DOI":"10.3389\/frsip.2021.776825"},{"key":"1901_CR18","unstructured":"Dantzig, G.B.: Linear Programming and Extensions, vol. 48. Princeton University Press (1998)"},{"key":"1901_CR19","unstructured":"Daskalakis, C., Andrew, I., Syrgkanis, V., Zeng, H.: Training GANs with optimism. In: International Conference on Learning Representations (2018)"},{"issue":"3","key":"1901_CR20","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1007\/s10957-018-1372-8","volume":"179","author":"D Davis","year":"2018","unstructured":"Davis, D., Drusvyatskiy, D., MacPhee, K.J., Paquette, C.: Subgradient methods for sharp weakly convex functions. J. Optim. Theory Appl. 179(3), 962\u2013982 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1901_CR21","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82(2), 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20133","key":"1901_CR22","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(1\u20133), 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"1901_CR23","unstructured":"Eckstein, J., Bertsekas, D.P.: et\u00a0al., An alternating direction method for linear programming (1990)"},{"key":"1901_CR24","unstructured":"Fercoq, O.: Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient (2021)"},{"issue":"4","key":"1901_CR25","doi-asserted-by":"crossref","first-page":"2069","DOI":"10.1093\/imanum\/drz007","volume":"39","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., Zheng, Q.: Adaptive restart of accelerated gradient methods under local quadratic growth condition. IMA J. Numer. Anal. 39(4), 2069\u20132095 (2019)","journal-title":"IMA J. Numer. Anal."},{"issue":"1\u20133","key":"1901_CR26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01594944","volume":"50","author":"MC Ferris","year":"1991","unstructured":"Ferris, M.C.: Finite termination of the proximal point algorithm. Math. Program. 50(1\u20133), 359\u2013366 (1991)","journal-title":"Math. Program."},{"issue":"2","key":"1901_CR27","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10107-017-1164-1","volume":"170","author":"RM Freund","year":"2018","unstructured":"Freund, R.M., Haihao, L.: New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure. Math. Program. 170(2), 445\u2013477 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"1901_CR28","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1080\/10556788.2019.1604702","volume":"35","author":"IL Galabova","year":"2020","unstructured":"Galabova, I.L., Hall, J.A.J.: The \u2018idiot\u2019 crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems. Optim. Methods Softw. 35(3), 488\u2013501 (2020)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1901_CR29","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-010-0430-2","volume":"133","author":"A Gilpin","year":"2012","unstructured":"Gilpin, A., Pena, J., Sandholm, T.: First-order algorithm with $$\\cal{O} (\\ln (1\/\\epsilon ))$$-convergence for $$\\epsilon $$-equilibrium in two-person zero-sum games. Math. Program. 133(1), 279\u2013298 (2012)","journal-title":"Math. Program."},{"key":"1901_CR30","doi-asserted-by":"crossref","unstructured":"Giselsson, P., Boyd, S.: Monotonicity and restart in fast gradient methods. In: 53rd IEEE Conference on Decision and Control, pp.\u00a05058\u20135063. IEEE (2014)","DOI":"10.1109\/CDC.2014.7040179"},{"key":"1901_CR31","unstructured":"Goldstein, T., Li, M., Yuan, X.: Adaptive primal-dual splitting methods for statistical learning and image processing. In: Advances in Neural Information Processing Systems, pp.\u00a02089\u20132097 (2015)"},{"issue":"3","key":"1901_CR32","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Interior point methods 25 years later. Eur. J. Oper. Res. 218(3), 587\u2013601 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1901_CR33","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/S0895479892237744","volume":"16","author":"O G\u00fcler","year":"1995","unstructured":"G\u00fcler, O., Hoffman, A.J., Rothblum, U.G.: Approximations to solutions to systems of linear inequalities. SIAM J. Matrix Anal. Appl. 16(2), 688\u2013696 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1901_CR34","doi-asserted-by":"crossref","unstructured":"Gutman, D.H., Pe\u00f1a, J.F.: The condition number of a function relative to a set. Math. Program. (2020), to appear","DOI":"10.1007\/s10107-020-01510-4"},{"key":"1901_CR35","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/mantech.1.1.46","volume":"1","author":"F Hanssmann","year":"1960","unstructured":"Hanssmann, F., Hess, S.W.: A linear programming approach to production and employment scheduling. Manag. Sci. 1, 46\u201351 (1960)","journal-title":"Manag. Sci."},{"issue":"1\u20133","key":"1901_CR36","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01582255","volume":"48","author":"PT Harker","year":"1990","unstructured":"Harker, P.T., Pang, J.-S.: Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications. Math. Program. 48(1\u20133), 161\u2013220 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"1901_CR37","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $${O}(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"1901_CR38","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49, 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1901_CR39","doi-asserted-by":"crossref","unstructured":"Hunter, J.K., Nachtergaele, B.: Applied Analysis. World Scientific Publishing Company (2001)","DOI":"10.1142\/4319"},{"key":"1901_CR40","first-page":"315","volume":"26","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Adv. Neural. Inf. Process. Syst. 26, 315\u2013323 (2013)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1901_CR41","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp.\u00a0302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"issue":"2","key":"1901_CR42","first-page":"191","volume":"41","author":"D Klatte","year":"1995","unstructured":"Klatte, D., Thiere, G.: Error bounds for solutions of linear equations and inequalities. Z. Oper. Res. 41(2), 191\u2013214 (1995)","journal-title":"Z. Oper. Res."},{"key":"1901_CR43","first-page":"747","volume":"12","author":"GM Korpelevich","year":"1976","unstructured":"Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Matecon 12, 747\u2013756 (1976)","journal-title":"Matecon"},{"key":"1901_CR44","unstructured":"Lewis, A.S, Liang, J.: Partial smoothness and constant rank, arXiv preprint arXiv:1807.03134 (2018)"},{"issue":"3","key":"1901_CR45","doi-asserted-by":"crossref","first-page":"2410","DOI":"10.1137\/19M1251795","volume":"30","author":"X Li","year":"2020","unstructured":"Li, X., Sun, D., Toh, K.-C.: An asymptotically superlinearly convergent semismooth newton augmented Lagrangian method for linear programming. SIAM J. Optim. 30(3), 2410\u20132440 (2020)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1901_CR46","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1080\/02331934.2018.1426584","volume":"67","author":"J Liang","year":"2018","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: Local linear convergence analysis of primal-dual splitting methods. Optimization 67(6), 821\u2013853 (2018)","journal-title":"Optimization"},{"key":"1901_CR47","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: A universal catalyst for first-order optimization. In: Advances in Neural Information Processing Systems, pp.\u00a03384\u20133392 (2015)"},{"key":"1901_CR48","unstructured":"Lin, Q., Xiao, L.: An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. In: International Conference on Machine Learning, pp.\u00a073\u201381 (2014)"},{"issue":"2\u20133","key":"1901_CR49","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1080\/10556788.2020.1821200","volume":"36","author":"T Lin","year":"2021","unstructured":"Lin, T., Ma, S., Ye, Y., Zhang, S.: An ADMM-based interior-point method for large-scale linear programming. Optim. Methods Softw. 36(2\u20133), 389\u2013424 (2021)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1901_CR50","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/msom.1070.0169","volume":"10","author":"Q Liu","year":"2008","unstructured":"Liu, Q., Van Ryzin, G.: On the choice-based linear programming model for network revenue management. Manuf. Serv. Oper. Manag. 10(2), 288\u2013310 (2008)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"1901_CR51","unstructured":"Lu, H.: An $${O}(s^r)$$-resolution ODE framework for discrete-time optimization algorithms and applications to convex-concave saddle-point problems, arXiv preprint arXiv:2001.08826 (2020)"},{"issue":"1","key":"1901_CR52","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46(1), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"1901_CR53","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.6.3.259","volume":"6","author":"AS Manne","year":"1960","unstructured":"Manne, A.S.: Linear programming and sequential decisions. Manag. Sci. 6(3), 259\u2013267 (1960)","journal-title":"Manag. Sci."},{"issue":"1","key":"1901_CR54","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/S1052623496309867","volume":"9","author":"P Marcotte","year":"1998","unstructured":"Marcotte, P., Zhu, D.: Weak sharp solutions of variational inequalities. SIAM J. Optim. 9(1), 179\u2013189 (1998)","journal-title":"SIAM J. Optim."},{"key":"1901_CR55","unstructured":"Mittelmann, H.D.: Benchmark of simplex LP solvers (2020). http:\/\/plato.asu.edu\/ftp\/lpsimp.html"},{"key":"1901_CR56","unstructured":"Mokhtari, A., Ozdaglar, A., Pattathil, S.: A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: proximal point approach. In: International Conference on Artificial Intelligence and Statistics (2020)"},{"issue":"1","key":"1901_CR57","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence O(1\/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex\u2013concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1901_CR58","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-013-0686-4","volume":"146","author":"Yu Nesterov","year":"2014","unstructured":"Nesterov, Yu.: Subgradient methods for huge-scale optimization problems. Math. Program. 146(1), 275\u2013297 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1901_CR59","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"1901_CR60","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1901_CR61","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: a basic course, vol. 87. Springer (2013)"},{"key":"1901_CR62","first-page":"372","volume":"27","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $${O} (1\/k^2)$$. Soviet Math. Doklady 27, 372\u2013376 (1983)","journal-title":"Soviet Math. Doklady"},{"key":"1901_CR63","unstructured":"Niao, H.: Mirror-prox algorithm, Fall (2016), http:\/\/niaohe.ise.illinois.edu\/IE598_2016\/pdf\/IE598-lecture18-mirror%20prox%20algorithm%20for%20saddle%20point%20problems.pdf"},{"issue":"3","key":"1901_CR64","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"1901_CR65","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169(3), 1042\u20131068 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1901_CR66","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a, J., Vera, J.C., Zuluaga, L.F.: New characterizations of Hoffman constants for systems of linear constraints. Math. Program. (2020), to appear","DOI":"10.1007\/s10107-020-01473-6"},{"key":"1901_CR67","doi-asserted-by":"crossref","unstructured":"Pokutta, S.: Restarting algorithms: sometimes there is free lunch. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp.\u00a022\u201338. Springer (2020)","DOI":"10.1007\/978-3-030-58942-4_2"},{"key":"1901_CR68","unstructured":"Polyak, B.: Sharp minima. In: Proceedings of the IIASA Workshop on Generalized Lagrangians and Their Applications, Laxenburg, Austria. Institute of Control Sciences Lecture Notes, Moscow (1979)"},{"key":"1901_CR69","volume-title":"Introduction to Optimization","author":"B Polyak","year":"1987","unstructured":"Polyak, B.: Introduction to Optimization. Optimization Software Inc, New York (1987)"},{"key":"1901_CR70","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, K.G., Resende, M.G.C., Ramachandran, B., Pekny, J.F.: Tight QAP Bounds via Linear Programming, pp. 297\u2013303. World Scientific Publishing Co. (2002)","DOI":"10.1142\/9789812778215_0019"},{"issue":"3","key":"1901_CR71","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/0805026","volume":"5","author":"J Renegar","year":"1995","unstructured":"Renegar, J.: Incorporating condition measures into the complexity theory of linear programming. SIAM J. Optim. 5(3), 506\u2013524 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"1901_CR72","first-page":"279","volume":"70","author":"J Renegar","year":"1995","unstructured":"Renegar, J.: Linear programming, complexity theory and elementary functional analysis. Math. Program. 70(1\u20133), 279\u2013351 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"1901_CR73","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/18M1224568","volume":"30","author":"V Roulet","year":"2020","unstructured":"Roulet, V., d\u2019Aspremont, A.: Sharpness, restart, and acceleration. SIAM J. Optim. 30(1), 262\u2013289 (2020)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1901_CR74","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R Tyrrell Rockafellar","year":"1976","unstructured":"Tyrrell Rockafellar, R.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control. Optim."},{"key":"1901_CR75","unstructured":"Tang, J., Golbabaee, M., Bach, F. et\u00a0al.: Rest-katyusha: exploiting the solution\u2019s structure via scheduled restart schemes. In: Advances in Neural Information Processing Systems, pp.\u00a0429\u2013440 (2018)"},{"key":"1901_CR76","unstructured":"Thomson, B.S., Bruckner, J.B., Bruckner, A.M.: Elementary real analysis, vol.\u00a01, ClassicalRealAnalysis.com (2008)"},{"issue":"1\u20132","key":"1901_CR77","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0377-0427(94)00094-H","volume":"60","author":"P Tseng","year":"1995","unstructured":"Tseng, P.: On linear convergence of iterative methods for the variational inequality problem. J. Comput. Appl. Math. 60(1\u20132), 237\u2013252 (1995)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"1901_CR78","first-page":"236","volume":"19","author":"T Yang","year":"2018","unstructured":"Yang, T., Lin, Q.: RSG: beating subgradient method without smoothness and strong convexity. J. Mach. Learn. Res. 19(1), 236\u2013268 (2018)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01901-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01901-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01901-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T19:06:18Z","timestamp":1690311978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01901-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,19]]},"references-count":78,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1901"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01901-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,19]]},"assertion":[{"value":"26 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}