{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:51:16Z","timestamp":1761580276163},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T00:00:00Z","timestamp":1107907200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10107-004-0514-y","type":"journal-article","created":{"date-parts":[[2005,2,8]],"date-time":"2005-02-08T10:13:14Z","timestamp":1107857594000},"page":"561-573","source":"Crossref","is-referenced-by-count":4,"title":["On the block-structured distance to non-surjectivity of sublinear mappings"],"prefix":"10.1007","volume":"103","author":[{"given":"Javier","family":"Pe\u00f1a","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,2,9]]},"reference":[{"key":"514_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF00938589","volume":"48","author":"Borwein","year":"1986","unstructured":"Borwein, J.: Norm duality for convex processes and applications. J. Optimization Theory and Applications 48, 53\u201364 (1986)","journal-title":"J. Optimization Theory and Applications"},{"key":"514_CR2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0613003","volume":"13","author":"Demmel","year":"1992","unstructured":"Demmel, J.: The componentwise distance to the nearest singular matrix. SIAM J. Matrix Anal. Appl. 13, 10\u201319 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"514_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1090\/S0002-9947-02-03088-X","volume":"355","author":"Dontchev","year":"2003","unstructured":"Dontchev, A., Lewis, A., Rockafellar, R.T.: The radius of metric regularity. Transactions of the American Mathematical Society 355, 493\u2013517 (2003)","journal-title":"Transactions of the American Mathematical Society"},{"key":"514_CR4","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1049\/ip-d.1982.0053","volume":"129","author":"Doyle","year":"1982","unstructured":"Doyle, J.: Analysis of feedback systems with structured uncertainties. IEE-D Proceedings 129, 242\u2013250 (1982)","journal-title":"IEE-D Proceedings"},{"key":"514_CR5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s101070000136","volume":"88","author":"Epelman","year":"2000","unstructured":"Epelman, M., Freund, R.: Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. Mathematical Programming 88, 451\u2013485 (2000)","journal-title":"Mathematical Programming"},{"key":"514_CR6","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.22.4.769","volume":"22","author":"Filipowski","year":"1997","unstructured":"Filipowski, S.: On the complexity of solving sparse symmetric linear programs specified with approximate data. Math. Oper. Res. 22, 769\u2013792 (1997)","journal-title":"Math. Oper. Res."},{"key":"514_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1137\/S105262349732829X","volume":"10","author":"Freund","year":"1999","unstructured":"Freund, R., Vera, J.: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm. SIAM J. Optimization 10, 155\u2013176 (1999)","journal-title":"SIAM J. Optimization"},{"key":"514_CR8","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1287\/moor.28.4.625.20509","volume":"28","author":"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, 625\u2013648 (2003)","journal-title":"Math. Oper. Res."},{"key":"514_CR9","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1287\/moor.24.4.829","volume":"24","author":"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":"514_CR10","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1012610112736","volume":"9","author":"Lewis","year":"2001","unstructured":"Lewis, A.: Ill-conditioned inclusions. Set-Valued Analysis 9, 375\u2013381 (2001)","journal-title":"Set-Valued Analysis"},{"key":"514_CR11","unstructured":"Lewis, A.: The structured distance to ill-posedness for conic systems. Preprint, Simon Fraser University, 2003"},{"key":"514_CR12","first-page":"1","volume":"83","author":"Nunez","year":"1998","unstructured":"Nunez, M., Freund, R.: Condition measures and properties of the central trajectory of a linear program. Mathematical Programming 83, 1\u201328 (1998)","journal-title":"Mathematical Programming"},{"key":"514_CR13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1137\/S1052623402401804","volume":"14","author":"Ordo\u00f1ez","year":"2003","unstructured":"Ordo\u00f1ez, F., Freund, R.: Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization. SIAM J. Optimization 14, 307\u2013333 (2003)","journal-title":"SIAM J. Optimization"},{"key":"514_CR14","unstructured":"Pe\u00f1a, J.: Condition numbers for linear programming. Ph.D. dissertation, Cornell University, 1998"},{"key":"514_CR15","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1137\/S1052623497323674","volume":"10","author":"Pe\u00f1a","year":"2000","unstructured":"Pe\u00f1a, J.: Understanding the geometry on infeasible perturbations of a conic linear system. SIAM J. Optimization 10, 534\u2013550 (2000)","journal-title":"SIAM J. Optimization"},{"key":"514_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(03)00392-6","volume":"370","author":"Pe\u00f1a","year":"2003","unstructured":"Pe\u00f1a, J.: A characterization of the distance to infeasibility under block-structured perturbations. Linear Algebra and its Applications 370, 193\u2013216 (2003)","journal-title":"Linear Algebra and its Applications"},{"key":"514_CR17","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/0805026","volume":"5","author":"Renegar","year":"1995","unstructured":"Renegar, J.: Incorporating condition numbers into the complexity theory of linear programming. SIAM J. Optimization 5, 506\u2013524 (1995)","journal-title":"SIAM J. Optimization"},{"key":"514_CR18","first-page":"279","volume":"70","author":"Renegar","year":"1995","unstructured":"Renegar, J.: Linear programming, complexity theory and elementary functional analysis. Mathematical Programming 70, 279\u2013351 (1995)","journal-title":"Mathematical Programming"},{"key":"514_CR19","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/moor.1.2.130","volume":"1","author":"Robinson","year":"1976","unstructured":"Robinson, S.: Regularity and stability for convex multifunctions. Math. Oper. Res. 1, 130\u2013143 (1976)","journal-title":"Math. Oper. Res."},{"key":"514_CR20","doi-asserted-by":"crossref","unstructured":"Rockafellar, T.: Convex Analysis. Princeton University Press, 1970","DOI":"10.1515\/9781400873173"},{"key":"514_CR21","doi-asserted-by":"crossref","unstructured":"Rockafellar, T., Wets, R.: Variational Analysis. Springer-Verlag, 1998","DOI":"10.1007\/978-3-642-02431-3"},{"key":"514_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0024-3795(89)90004-9","volume":"126","author":"Rohn","year":"1989","unstructured":"Rohn, J.: Systems of linear interval equations. Linear Algebra and its Applications 126, 39\u201378 (1989)","journal-title":"Linear Algebra and its Applications"},{"key":"514_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0024-3795(96)00522-8","volume":"266","author":"Rump","year":"1997","unstructured":"Rump, S.: Theorems of Perron-Frobenius type for matrices without sign restrictions. Linear Algebra and its Applications 266, 1\u201342 (1997)","journal-title":"Linear Algebra and its Applications"},{"key":"514_CR24","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1137\/S0036144598323216","volume":"41","author":"Rump","year":"1999","unstructured":"Rump, S.: Ill-conditioned matrices are componentwise near to singularity. SIAM Review 41, 102\u2013112 (1999)","journal-title":"SIAM Review"},{"key":"514_CR25","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1137\/S105262349223352X","volume":"6","author":"Vera","year":"1996","unstructured":"Vera, J.: Ill-posedness and the complexity of deciding existence of solutions to linear programs. SIAM J. Optimization 6, 549\u2013569 (1996)","journal-title":"SIAM J. Optimization"},{"key":"514_CR26","unstructured":"Zhou, K., Doyle, J., Glover, K.: Robust and Optimal Control. Prentice Hall, 1996"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0514-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0514-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0514-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:56Z","timestamp":1559123396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0514-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0514-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2,9]]}}}