{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:12:26Z","timestamp":1769969546309,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T00:00:00Z","timestamp":1588723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T00:00:00Z","timestamp":1588723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10107-020-01510-4","type":"journal-article","created":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T13:03:56Z","timestamp":1588770236000},"page":"255-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["The condition number of a function relative to a set"],"prefix":"10.1007","volume":"188","author":[{"given":"David H.","family":"Gutman","sequence":"first","affiliation":[]},{"given":"Javier F.","family":"Pe\u00f1a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"issue":"2","key":"1510_CR1","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"H Bauschke","year":"2016","unstructured":"Bauschke, H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2016)","journal-title":"Math. Oper. Res."},{"key":"1510_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1069-4","volume":"164","author":"A Beck","year":"2017","unstructured":"Beck, A., Shtern, S.: Linearly convergent away-step conditional gradient for non-strongly convex functions. Math. Program. 164, 1\u201327 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"1510_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s001860300327","volume":"59","author":"A Beck","year":"2004","unstructured":"Beck, A., Teboulle, M.: A conditional gradient method with linear rate of convergence for solving convex linear systems. Math. Methods Oper. Res. 59(2), 235\u2013247 (2004)","journal-title":"Math. Methods Oper. Res."},{"key":"1510_CR4","unstructured":"Bubeck, S., Lee, Y., Singh, M.: A geometric alternative to Nesterov\u2019s accelerated gradient descent. arXiv preprint arXiv:1506.08187 (2015)"},{"issue":"3","key":"1510_CR5","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1510_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s101070100237","volume":"91","author":"D Cheung","year":"2001","unstructured":"Cheung, D., Cucker, F.: A new condition number for linear programming. Math. Prog. 91(2), 163\u2013174 (2001)","journal-title":"Math. Prog."},{"issue":"2","key":"1510_CR7","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1090\/S0002-9947-02-03088-X","volume":"355","author":"AL Dontchev","year":"2003","unstructured":"Dontchev, A.L., Lewis, A.S., Rockafellar, R.T.: The radius of metric regularity. Trans. Am. Math. Soc. 355(2), 493\u2013517 (2003)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"1510_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/16M1072528","volume":"28","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Fazel, M., Roy, S.: An optimal first order method based on optimal quadratic averaging. SIAM J. Optim. 28(1), 251\u2013271 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1510_CR9","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/S1052623400373829","volume":"12","author":"M Epelman","year":"2002","unstructured":"Epelman, M., Freund, R.: A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems. SIAM J. Optim. 12(3), 627\u2013655 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1510_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s101070000136","volume":"88","author":"M Epelman","year":"2000","unstructured":"Epelman, M., Freund, R.M.: Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. Math Program. 88(3), 451\u2013485 (2000)","journal-title":"Math Program."},{"key":"1510_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10107-003-0435-1","volume":"99","author":"R Freund","year":"2004","unstructured":"Freund, R.: Complexity of convex optimization using geometry-based measures and a reference point. Math Program. 99, 197\u2013221 (2004)","journal-title":"Math Program."},{"key":"1510_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/S105262349732829X","volume":"10","author":"R Freund","year":"1999","unstructured":"Freund, R., Vera, J.: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm. SIAM J. Optim. 10, 155\u2013176 (1999)","journal-title":"SIAM J. Optim."},{"key":"1510_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01589445","volume":"35","author":"J Gu\u00e9lat","year":"1986","unstructured":"Gu\u00e9lat, J., Marcotte, P.: Some comments on Wolfe\u2019s away step. Math. Program. 35, 110\u2013119 (1986)","journal-title":"Math. Program."},{"issue":"6","key":"1510_CR14","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1007\/s11590-019-01390-4","volume":"13","author":"D Gutman","year":"2019","unstructured":"Gutman, D.: Enhanced basic procedures for the projection and rescaling algorithm. Optim. Lett. 13(6), 1259\u20131267 (2019)","journal-title":"Optim. Lett."},{"issue":"4","key":"1510_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A Hoffman","year":"1952","unstructured":"Hoffman, A.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bureau Stand. 49(4), 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bureau Stand."},{"key":"1510_CR16","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: Projection-free sparse convex optimization. In ICML, volume\u00a028 of JMLR Proceedings, pp. 427\u2013435 (2013)"},{"key":"1510_CR17","unstructured":"Karimi, S., Vavasis, S.: A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent. arXiv preprint arXiv:1712.09498 (2017)"},{"key":"1510_CR18","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank\u2013Wolfe optimization variants. In: Advances in Neural Information Processing Systems (NIPS) (2015)"},{"issue":"4","key":"1510_CR19","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1287\/moor.24.4.829","volume":"24","author":"A Lewis","year":"1999","unstructured":"Lewis, A.: Ill-conditioned convex processes and conic linear systems. Math. Oper. Res. 24(4), 829\u2013834 (1999)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1510_CR20","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"key":"1510_CR21","unstructured":"Ma, C., Gudapati, N., Jahani, M., Tappenden, R., Tak\u00e1\u010d, M.: Underestimate sequences via quadratic averaging. arXiv preprint arXiv:1710.03695 (2017)"},{"key":"1510_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175, 69\u2013107 (2019)","journal-title":"Math. Program."},{"key":"1510_CR23","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Applied Optimization (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"1510_CR24","doi-asserted-by":"publisher","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."},{"issue":"2","key":"1510_CR25","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1137\/S1052623402401804","volume":"14","author":"F Ord\u00f3\u00f1ez","year":"2003","unstructured":"Ord\u00f3\u00f1ez, F., Freund, R.: Computational experience and the explanatory value of condition measures for linear optimization. SIAM J. Optim. 14(2), 307\u2013333 (2003)","journal-title":"SIAM J. Optim."},{"key":"1510_CR26","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a, J., Vera, J., Zuluaga, L.: New characterizations of Hoffman constants for system of linear constraints. To Appear in Math. Program. (2020)","DOI":"10.1007\/s10107-020-01473-6"},{"key":"1510_CR27","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/S1052623497323674","volume":"10","author":"J Pe\u00f1a","year":"2000","unstructured":"Pe\u00f1a, J.: Understanding the geometry on infeasible perturbations of a conic linear system. SIAM J. Optim. 10, 534\u2013550 (2000)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1510_CR28","first-page":"1","volume":"44","author":"J Pe\u00f1a","year":"2019","unstructured":"Pe\u00f1a, J., Rodr\u00edguez, D.: Polytope conditioning and linear convergence of the Frank\u2013Wolfe algorithm. Math. Oper. Res. 44(1), 1\u201318 (2019)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1510_CR29","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1080\/10556788.2015.1099652","volume":"31","author":"A Ramdas","year":"2016","unstructured":"Ramdas, A., Pe\u00f1a, J.: Towards a deeper geometric, analytic and algorithmic understanding of margins. Optim. Methods Softw. 31(2), 377\u2013391 (2016)","journal-title":"Optim. Methods Softw."},{"key":"1510_CR30","doi-asserted-by":"publisher","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, 506\u2013524 (1995)","journal-title":"SIAM J. Optim."},{"issue":"3, Ser. A","key":"1510_CR31","first-page":"279","volume":"70","author":"J Renegar","year":"1995","unstructured":"Renegar, J.: Linear programming, complexity theory and elementary functional analysis. Math. Program. 70(3, Ser. A), 279\u2013351 (1995)","journal-title":"Math. Program."},{"key":"1510_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","volume":"170","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. 170, 67\u201396 (2018)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01510-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01510-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01510-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T15:54:04Z","timestamp":1624377244000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01510-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,6]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1510"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01510-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,6]]},"assertion":[{"value":"24 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}