{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:53:12Z","timestamp":1762339992433},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1007\/bf01584841","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:36:57Z","timestamp":1114677417000},"page":"1-21","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming"],"prefix":"10.1007","volume":"81","author":[{"given":"Michael J.","family":"Todd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR2","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester, 1986."},{"issue":"2","key":"CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, Path following methods for linear programming, SIAM Review 34 (2) (1992) 167\u2013227.","journal-title":"SIAM Review"},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-1134-8","volume-title":"Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity","author":"D. Hertog den","year":"1994","unstructured":"D. den Hertog, Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994."},{"key":"CR5","first-page":"3","volume":"76","author":"M.J. Todd","year":"1996","unstructured":"M.J. Todd, Potential-reduction methods in mathematical programming, Mathematical Programming 76 (1996) 3\u201345.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF01585180","volume":"62","author":"S. Mehrotra","year":"1993","unstructured":"S. Mehrotra, Y. Ye, Finding an interior point in the optimal face of linear programs, Mathematical Programming 62 (1993) 497\u2013515.","journal-title":"Mathematical Programming"},{"key":"CR7","first-page":"79","volume":"74","author":"S.A. Vavasis","year":"1996","unstructured":"S.A. Vavasis, Y. Ye, A primal-dual interior point method whose running time depends only on the constraint matrix, Mathematical Programming 74 (1996) 79\u2013120.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(73)90007-4","volume":"6","author":"S.M. Robinson","year":"1973","unstructured":"S.M. Robinson, Bounds for the error in the solution set of a perturbed linear program, Linear Algebra and Its Applications 6 (1973) 69\u201381.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR9","first-page":"3","volume-title":"Methods of Operations Research, vol. 43","author":"O.L. Mangasarian","year":"1981","unstructured":"O.L. Mangasarian, A condition number for linear inequalities and linear programs, in: G. Bamberg, O. Opitz (Eds.), Methods of Operations Research, vol. 43, Verlagsgruppe Athenaum\/Hain\/Scriptor\/Hanstein, Konigstein, 1981, pp. 3\u201315."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02591851","volume":"38","author":"R.M. Freund","year":"1987","unstructured":"R.M. Freund, Dual gauge programs, with applications to quadratic programming and the minimumnorm problem, Mathematical Programming 38 (1987) 47\u201367.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01581690","volume":"65","author":"J. Renegar","year":"1994","unstructured":"J. Renegar, Some perturbation theory for linear programming, Mathematical Programming 65 (1994) 73\u201382.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00952828","volume":"76","author":"A. Dax","year":"1993","unstructured":"A. Dax, On minimum norm solutions, Journal of Optimization Theory and Applications 76 (1993) 183\u2013193.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR13","first-page":"15","volume":"21","author":"I.I. Yeremin","year":"1983","unstructured":"I.I. Yeremin, Duality for improper linear and convex programming problems and methods of correcting them, Engineering Cybernetics 21 (1983) 15\u201326.","journal-title":"Engineering Cybernetics"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo, S. Mizuno, A primal-dual infeasible-interior-point algorithm for linear programming, Mathematical Programming 61 (1993) 263\u2013280.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I.J. Lustig","year":"1990\/91","unstructured":"I.J. Lustig, Feasibility issues in a primal-dual interior point method for linear programming, Mathematical Programming 49 (1990\/91) 145\u2013162.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, R.E. Marsten, D.F. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra and Its Applications 152 (1991) 191\u2013222.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S. Mizuno","year":"1994","unstructured":"S. Mizuno, Polynomiality of infeasible-interior-point algorithms for linear programming, Mathematical Programming 67 (1994) 109\u2013119.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0806002","volume":"6","author":"F.A. Potra","year":"1996","unstructured":"F.A. Potra, An infeasible interior-point predictor-corrector algorithm for linear programming, SIAM Journal on Optimization 6 (1996) 19\u201332.","journal-title":"SIAM Journal on Optimization"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01582228","volume":"67","author":"F.A. Potra","year":"1994","unstructured":"F.A. Potra, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, Mathematical Programming 67 (1994) 383\u2013406.","journal-title":"Mathematical Programming"},{"key":"CR20","first-page":"52","volume":"19","author":"Y. Ye","year":"1994","unstructured":"Y. Ye, M.J. Todd, S. Mizuno, An O( $$\\sqrt n $$ L)-iteration homogeneous and self-dual linear programming algorithm, Mathematics of Operations Research 19 (1994) 52\u201367.","journal-title":"Mathematics of Operations Research"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Y. Zhang, On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem, SIAM Journal on Optimization 4 (1994) 208\u2013227.","journal-title":"SIAM Journal on Optimization"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A.J. Hoffman","year":"1952","unstructured":"A.J. Hoffman, On approximate solutions of systems of linear inequalities, Journal of Research of the National Bureau of Standards 49 (1952) 263\u2013265.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/S0895479892237744","volume":"16","author":"O. G\u00fcler","year":"1995","unstructured":"O. G\u00fcler, A.J. Hoffman, U.G. Rothblum, Approximations to solutions to systems of linear inequalities, SIAM Journal on Matrix Analysis and Applications 16 (1995) 688\u2013696.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/0377-2217(85)90116-X","volume":"22","author":"T. Terlaky","year":"1985","unstructured":"T. Terlaky, Onl p programming, European Journal of Operations Research 22 (1985) 70\u2013100.","journal-title":"European Journal of Operations Research"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"S. Mizuno, M.J. Todd, Y. Ye, On adaptive step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18 (1993) 964\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O. G\u00fcler","year":"1993","unstructured":"O. G\u00fcler, Y. Ye, Convergence behavior of interior-point algorithms, Mathematical Programming 60 (1993) 215\u2013228.","journal-title":"Mathematical Programming"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X. Xu","year":"1996","unstructured":"X. Xu, P.-F. Hung, Y. Ye, A simplified homogeneous and self-dual linear programming algorithm and its implementation, Annals of Operations Research 62 (1996) 151\u2013172.","journal-title":"Annals of Operations Research"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02206809","volume":"62","author":"M. Kojima","year":"1996","unstructured":"M. Kojima, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, Annals of Operations Research 62 (1996) 1\u201328.","journal-title":"Annals of Operations Research"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y. Zhang","year":"1995","unstructured":"Y. Zhang, D. Zhang, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithm, Mathematical Programming 68 (1995) 303\u2013318.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584841.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584841\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:29:34Z","timestamp":1556897374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["BF01584841"],"URL":"https:\/\/doi.org\/10.1007\/bf01584841","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}