{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T15:28:31Z","timestamp":1680103711773},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,8,23]],"date-time":"2008-08-23T00:00:00Z","timestamp":1219449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10208-008-9034-0","type":"journal-article","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T05:27:19Z","timestamp":1219642039000},"page":"335-358","source":"Crossref","is-referenced-by-count":4,"title":["Conditioning of Random Conic Systems Under a\u00a0General Family of Input Distributions"],"prefix":"10.1007","volume":"9","author":[{"given":"Raphael","family":"Hauser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,23]]},"reference":[{"issue":"1","key":"9034_CR1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1287\/moor.24.1.176","volume":"24","author":"K.M. Anstreicher","year":"1999","unstructured":"K.M. Anstreicher, J. Ji, F.A. Potra, Y. Ye, Probabilistic analysis of an infeasible-interior-point algorithm for linear programming, Math. Oper. Res. 24(1), 176\u2013192 (1999).","journal-title":"Math. Oper. Res."},{"key":"9034_CR2","unstructured":"A. Blum, J. Dunagan, Smoothed analysis of the perceptron algorithm for linear programming, in\u00a0SODA\u201902, pp. 905\u2013914 (2002)."},{"key":"9034_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1998","unstructured":"L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation (Springer, Berlin, 1998)."},{"key":"9034_CR4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.7.3.441","volume":"7","author":"K.H. Borgwardt","year":"1982","unstructured":"K.H. Borgwardt, Some distribution\u2013independent results about the asymptotic order of the average number of pivot steps of the simplex method, Math. Oper. Res. 7, 441\u2013462 (1982).","journal-title":"Math. Oper. Res."},{"key":"9034_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s101070100237","volume":"91","author":"D. Cheung","year":"2001","unstructured":"D. Cheung, F. Cucker, A new condition number for linear programming, Math. Program. 91, 163\u2013174 (2001).","journal-title":"Math. Program."},{"issue":"4","key":"9034_CR6","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1137\/S105262340343470X","volume":"15","author":"D. Cheung","year":"2005","unstructured":"D. Cheung, F. Cucker, R. Hauser, Tail decay and moment estimates of a condition number for random linear conic systems, SIAM J. Optim. 15(4), 1237\u20131261 (2005).","journal-title":"SIAM J. Optim."},{"key":"9034_CR7","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/S1052623401386794","volume":"12","author":"F. Cucker","year":"2002","unstructured":"F. Cucker, J. Pe\u00f1a, A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine, SIAM J. Optim. 12, 522\u2013554 (2002).","journal-title":"SIAM J. Optim."},{"key":"9034_CR8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s00211-002-0385-1","volume":"94","author":"F. Cucker","year":"2002","unstructured":"F. Cucker, M. Wschebor, On the expected condition number of linear programming problems, Numer. Math. 94, 419\u2013478 (2002).","journal-title":"Numer. Math."},{"key":"9034_CR9","unstructured":"J. Dunagan, D.A. Spielman, S.-H. Teng, Smoothed analysis of Renegar\u2019s condition number for linear programming. Preprint http:\/\/theory.lcs.mit.edu\/~spielman (2003)."},{"key":"9034_CR10","doi-asserted-by":"crossref","unstructured":"J. Dunagan, S. Vempala, A simple polynomial-time rescaling algorithm for solving linear programs, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 315\u2013320 (2004).","DOI":"10.1145\/1007352.1007404"},{"key":"9034_CR11","volume-title":"Geometric Measure Theory","author":"H. Federer","year":"1969","unstructured":"H. Federer, Geometric Measure Theory (Springer, Berlin, 1969)."},{"key":"9034_CR12","unstructured":"J.-L. Goffin, On the finite convergence of the relaxation method for solving systems of inequalities. Ph.D. thesis, University of California, Berkeley (1971)."},{"key":"9034_CR13","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/moor.5.3.388","volume":"5","author":"J.-L. Goffin","year":"1980","unstructured":"J.-L. Goffin, The relaxation method for solving systems of linear inequalities, Math. Oper. Res. 5, 388\u2013414 (1980).","journal-title":"Math. Oper. Res."},{"key":"9034_CR14","unstructured":"R. Hauser, T. M\u00fcller, Algebraic tail decay of condition numbers for random conic systems under a\u00a0general family of input distributions. Numerical Analysis Group Research Report NA-06\/01, Oxford University Computing Laboratory (2006)."},{"key":"9034_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-58891-4_3","volume-title":"Operations Research Proceedings 1997 (Jena)","author":"P. Huhn","year":"1998","unstructured":"P. Huhn, K.H. Borgwardt, An upper bound for the average number of iterations required in phase II of an interior-point-method, in Operations Research Proceedings 1997 (Jena) (Springer, Berlin, 1998), pp. 19\u201324."},{"issue":"3","key":"9034_CR16","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1006\/jcom.2002.0640","volume":"18","author":"P. Huhn","year":"2002","unstructured":"P. Huhn, K.H. Borgwardt, Interior-point methods: worst case and average case analysis of a phase-I algorithm and a termination procedure, J. Complex. 18(3), 833\u2013910 (2002).","journal-title":"J. Complex."},{"key":"9034_CR17","first-page":"279","volume":"70","author":"J. Renegar","year":"1995","unstructured":"J. Renegar, Linear programming, complexity theory and elementary functional analysis, Math. Program. 70, 279\u2013351 (1995).","journal-title":"Math. Program."},{"key":"9034_CR18","volume-title":"Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms","author":"R. Rosenblatt","year":"1962","unstructured":"R. Rosenblatt, Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms (Spartan Books, Washington, 1962)."},{"key":"9034_CR19","volume-title":"Probability Models in Computer Science","author":"S.M. Ross","year":"2002","unstructured":"S.M. Ross, Probability Models in Computer Science (Harcourt\/Academic Press, San Diego, 2002)."},{"key":"9034_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02591902","volume":"27","author":"S. Smale","year":"1983","unstructured":"S. Smale, On the average number of steps of the simplex method of linear programming, Math. Program. 27, 241\u2013262 (1983).","journal-title":"Math. Program."},{"key":"9034_CR21","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D. Spielman","year":"2004","unstructured":"D. Spielman, S. Teng, Smoothed analysis: Why the simplex algorithm usually takes polynomial time, J. Assoc. Comput. Mach. 51, 385\u2013463 (2004).","journal-title":"J. Assoc. Comput. Mach."},{"key":"9034_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/PL00011420","volume":"90","author":"M.J. Todd","year":"2001","unstructured":"M.J. Todd, L. Tun\u00e7el, Y. Ye, Characterizations, bounds and probabilistic analysis of two complexity measures for linear programming problems, Math. Program. 90, 59\u201369 (2001).","journal-title":"Math. Program."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-008-9034-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-008-9034-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-008-9034-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:05:09Z","timestamp":1559113509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-008-9034-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,23]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9034"],"URL":"https:\/\/doi.org\/10.1007\/s10208-008-9034-0","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,23]]}}}