{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:11:00Z","timestamp":1770268260852,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CMMI-1534850"],"award-info":[{"award-number":["CMMI-1534850"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10107-020-01473-6","type":"journal-article","created":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T03:02:34Z","timestamp":1581303754000},"page":"79-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["New characterizations of Hoffman constants for systems of linear constraints"],"prefix":"10.1007","volume":"187","author":[{"given":"Javier","family":"Pe\u00f1a","sequence":"first","affiliation":[]},{"given":"Juan C.","family":"Vera","sequence":"additional","affiliation":[]},{"given":"Luis F.","family":"Zuluaga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,10]]},"reference":[{"issue":"3","key":"1473_CR1","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1137\/110835177","volume":"22","author":"D Amelunxen","year":"2012","unstructured":"Amelunxen, D., B\u00fcrgisser, P.: A coordinate-free condition number for convex programming. SIAM J. Optim. 22(3), 1029\u20131041 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1473_CR2","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1137\/S1052623400375853","volume":"12","author":"D Az\u00e9","year":"2002","unstructured":"Az\u00e9, D., Corvellec, J.: On the sensitivity analysis of Hoffman constants for systems of linear inequalities. SIAM J. Optim. 12(4), 913\u2013927 (2002)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1473_CR3","doi-asserted-by":"crossref","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":"1473_CR4","doi-asserted-by":"crossref","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."},{"key":"1473_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-38896-5","volume-title":"Condition","author":"P B\u00fcrgisser","year":"2013","unstructured":"B\u00fcrgisser, P., Cucker, F.: Condition. Springer, Berlin (2013)"},{"issue":"2","key":"1473_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1137\/0806015","volume":"6","author":"J Burke","year":"1996","unstructured":"Burke, J., Tseng, P.: A unified analysis of Hoffman\u2019s bound via Fenchel duality. SIAM J. Optim. 6(2), 265\u2013282 (1996)","journal-title":"SIAM J. Optim."},{"key":"1473_CR7","doi-asserted-by":"crossref","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, 627\u2013655 (2002)","journal-title":"SIAM J. Optim."},{"key":"1473_CR8","doi-asserted-by":"crossref","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":"1473_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107990063a","volume":"86","author":"R Freund","year":"1999","unstructured":"Freund, R., Vera, J.: Some characterizations and properties of the \u201cdistance to ill-posedness\u201d and the condition measure of a conic linear system. Math. Program. 86, 225\u2013260 (1999)","journal-title":"Math. Program."},{"issue":"4","key":"1473_CR10","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1287\/moor.28.4.625.20509","volume":"28","author":"R Freund","year":"2003","unstructured":"Freund, R., Vera, J.: On the complexity of computing estimates of condition measures of a conic linear system. Math. Oper. Res. 28(4), 625\u2013648 (2003)","journal-title":"Math. Oper. Res."},{"key":"1473_CR11","unstructured":"Garber, D.: Fast rates for online gradient descent without strong convexity via Hoffman\u2019s bound. arXiv preprint arXiv:1802.04623 (2018)"},{"issue":"1\u20133","key":"1473_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01580862","volume":"47","author":"F Granot","year":"1990","unstructured":"Granot, F., Skorin-Kapov, J.: Some proximity and sensitivity results in quadratic integer programming. Math. Program. 47(1\u20133), 259\u2013268 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"1473_CR13","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., Rothblum, U.: 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":"1473_CR14","doi-asserted-by":"crossref","unstructured":"Gutman, D., Pe\u00f1a, J.: The condition number of a function relative to a set. arXiv preprint arXiv:1901.08359 (2019)","DOI":"10.1007\/s10107-020-01510-4"},{"issue":"4","key":"1473_CR15","doi-asserted-by":"crossref","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. Bur. Stand. 49(4), 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1473_CR16","unstructured":"IBM ILOG CPLEX Optimization Studio-CPLEX. Users manual-version 12 release 6 (2013)"},{"issue":"3","key":"1473_CR17","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1137\/S0363012998339216","volume":"38","author":"A Jourani","year":"2000","unstructured":"Jourani, A.: Hoffman\u2019s error bound, local controllability, and sensitivity analysis. SIAM J. Control Optim. 38(3), 947\u2013970 (2000)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1473_CR18","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-011-0228-2","volume":"20","author":"J J\u00fadice","year":"2012","unstructured":"J\u00fadice, J.: Algorithms for linear programming with linear complementarity constraints. Top 20(1), 4\u201325 (2012)","journal-title":"Top"},{"issue":"2","key":"1473_CR19","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":"1473_CR20","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)"},{"key":"1473_CR21","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.: Randomized methods for linear constraints: convergence rates and conditioning. Math. Oper. Res. 35, 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"key":"1473_CR22","doi-asserted-by":"crossref","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 linear inequalities. Math. Oper. Res. 24, 829\u2013834 (1999)","journal-title":"Math. Oper. Res."},{"key":"1473_CR23","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1287\/moor.1040.0104","volume":"29","author":"A Lewis","year":"2005","unstructured":"Lewis, A.: The structured distance to ill-posedness for conic systems. Math. Oper. Res. 29, 776\u2013785 (2005)","journal-title":"Math. Oper. Res."},{"key":"1473_CR24","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0024-3795(93)90125-8","volume":"187","author":"W Li","year":"1993","unstructured":"Li, W.: The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program. Linear Algebra Appl. 187, 15\u201340 (1993)","journal-title":"Linear Algebra Appl."},{"key":"1473_CR25","unstructured":"Lu, H.: Relative-continuity\u201d for non-Lipschitz non-smooth convex optimization using stochastic (or deterministic) mirror descent. arXiv preprint arXiv:1710.04718 (2017)"},{"issue":"1","key":"1473_CR26","doi-asserted-by":"crossref","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."},{"issue":"1","key":"1473_CR27","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z Luo","year":"1993","unstructured":"Luo, Z., 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":"1473_CR28","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0325033","volume":"25","author":"O Mangasarian","year":"1987","unstructured":"Mangasarian, O., Shiau, T.-H.: Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems. SIAM J. Control Optim. 25(3), 583\u2013595 (1987)","journal-title":"SIAM J. Control Optim."},{"key":"1473_CR29","doi-asserted-by":"crossref","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":"1473_CR30","unstructured":"Nguyen, T.: A stroll in the jungle of error bounds. arXiv preprint arXiv:1704.06938 (2017)"},{"key":"1473_CR31","first-page":"299","volume":"79","author":"JS Pang","year":"1997","unstructured":"Pang, J.S.: Error bounds in mathematical programming. Math. Program. 79, 299\u2013332 (1997)","journal-title":"Math. Program."},{"key":"1473_CR32","doi-asserted-by":"crossref","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."},{"key":"1473_CR33","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(03)00392-6","volume":"370","author":"J Pe\u00f1a","year":"2003","unstructured":"Pe\u00f1a, J.: A characterization of the distance to infeasibility under block-structured perturbations. Linear Algebra Appl. 370, 193\u2013216 (2003)","journal-title":"Linear Algebra Appl."},{"key":"1473_CR34","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\u201318 (2019)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1473_CR35","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s11081-017-9369-y","volume":"19","author":"S Pineda","year":"2018","unstructured":"Pineda, S., Bylling, H., Morales, J.: Efficiently solving linear bilevel programming problems using off-the-shelf optimization software. Optim. Eng. 19(1), 187\u2013211 (2018)","journal-title":"Optim. Eng."},{"issue":"2","key":"1473_CR36","doi-asserted-by":"crossref","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":"1473_CR37","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, 506\u2013524 (1995)","journal-title":"SIAM J. Optim."},{"key":"1473_CR38","first-page":"279","volume":"70","author":"J Renegar","year":"1995","unstructured":"Renegar, J.: Linear programming, complexity theory and elementary functional analysis. Math. Program. 70, 279\u2013351 (1995)","journal-title":"Math. Program."},{"key":"1473_CR39","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(73)90007-4","volume":"6","author":"S Robinson","year":"1973","unstructured":"Robinson, S.: Bounds for error in the solution set of a perturbed linear program. Linear Algebra Appl. 6, 69\u201381 (1973)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1473_CR40","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s11067-012-9178-y","volume":"13","author":"S Siddiqui","year":"2013","unstructured":"Siddiqui, S., Gabriel, S.: An SOS1-based approach for solving mpecs with a natural gas market application. Netw. Spat. Econ. 13(2), 205\u2013227 (2013)","journal-title":"Netw. Spat. Econ."},{"issue":"1\u20132","key":"1473_CR41","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s10107-015-0872-7","volume":"156","author":"O Stein","year":"2016","unstructured":"Stein, O.: Error bounds for mixed integer linear optimization problems. Math. Program. 156(1\u20132), 101\u2013123 (2016)","journal-title":"Math. Program."},{"key":"1473_CR42","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0024-3795(89)90594-6","volume":"112","author":"G Stewart","year":"1989","unstructured":"Stewart, G.: On scaled projections and pseudoinverses. Linear Algebra Appl. 112, 189\u2013193 (1989)","journal-title":"Linear Algebra Appl."},{"key":"1473_CR43","first-page":"1","volume":"1","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. 1, 1\u201330 (2018)","journal-title":"Math. Program."},{"issue":"6","key":"1473_CR44","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1287\/opre.38.6.1006","volume":"38","author":"M Todd","year":"1990","unstructured":"Todd, M.: A Dantzig\u2013Wolfe-like variant of Karmarkar\u2019s interior-point linear programming algorithm. Oper. Res. 38(6), 1006\u20131018 (1990)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"1473_CR45","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-007-0121-9","volume":"116","author":"H Van Ngai","year":"2009","unstructured":"Van Ngai, H., Th\u00e9ra, M.: Error bounds for systems of lower semicontinuous functions in Asplund spaces. Math. Program. 116(1\u20132), 397\u2013427 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"1473_CR46","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02592148","volume":"74","author":"S Vavasis","year":"1996","unstructured":"Vavasis, S., Ye, Y.: A primal-dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74(1), 79\u2013120 (1996)","journal-title":"Math. Program."},{"issue":"1","key":"1473_CR47","first-page":"1523","volume":"15","author":"P Wang","year":"2014","unstructured":"Wang, P., Lin, C.: Iteration complexity of feasible descent methods for convex optimization. J. Mach. Learn. Res. 15(1), 1523\u20131548 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1473_CR48","doi-asserted-by":"publisher","unstructured":"Xia, W., Vera, J., Zuluaga, L.F.: Globally solving non-convex quadratic programs via linear integer programming techniques. INFORMS J. Comput. (2020). https:\/\/doi.org\/10.1287\/ijoc.2018.0883","DOI":"10.1287\/ijoc.2018.0883"},{"issue":"2","key":"1473_CR49","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/S1052623402403505","volume":"14","author":"C Zalinescu","year":"2003","unstructured":"Zalinescu, C.: Sharp estimates for Hoffman\u2019s constant for systems of linear inequalities and equalities. SIAM J. Optim. 14(2), 517\u2013533 (2003)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1473_CR50","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1137\/S105262349834429X","volume":"10","author":"S Zhang","year":"2000","unstructured":"Zhang, S.: Global error bounds for convex conic problems. SIAM J. Optim. 10(3), 836\u2013851 (2000)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1473_CR51","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, A.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165(2), 689\u2013728 (2017)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01473-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01473-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01473-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T18:44:04Z","timestamp":1618944244000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01473-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,10]]},"references-count":51,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["1473"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01473-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,10]]},"assertion":[{"value":"23 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}