{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:50:54Z","timestamp":1752461454442},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":[[1994,8]]},"DOI":"10.1007\/bf01581140","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:41:12Z","timestamp":1114681272000},"page":"123-135","source":"Crossref","is-referenced-by-count":29,"title":["Computational experience with a globally convergent primal\u2014dual predictor\u2014corrector algorithm for linear programming"],"prefix":"10.1007","volume":"66","author":[{"given":"Irvin J.","family":"Lustig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roy E.","family":"Marsten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David F.","family":"Shanno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1137\/0803036","volume":"3","author":"T.J. Carpenter","year":"1993","unstructured":"T.J. Carpenter, I.J. Lustig, J.M. Mulvey and D.F. Shanno, \u201cHigher order predictor\u2014corrector interior point methods with application to quadratic objectives,\u201dSIAM Journal on Optimization, 3 (1993) 696\u2013725.","journal-title":"SIAM Journal on Optimization"},{"key":"CR2","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal,Linear Programming (W.H. Freeman and Company, New York, USA, 1983)."},{"key":"CR3","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (John Wiley & Sons, New York, 1968)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01582900","volume":"52","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cA potential-function reduction algorithm for solving a linear program directly from an infeasible \u2018warm start\u2019,\u201dMathematical Programming, 52 (1991) 441\u2013466.","journal-title":"Mathematical Programming"},{"key":"CR5","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems.\u201dMathematical Programming Society COAL Newsletter, 1985."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, \u201cA primal\u2014dual infeasible-interior point algorithm for linear programming,\u201dMathematical Programming 61 (1993) 263\u2013280.","journal-title":"Mathematical Programming"},{"key":"CR7","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 and D.F. Shanno, \u201cComputational experience with a primal\u2014dual interior point method for linear programming,\u201dLinear Algebra and Its Applications 152 (1991) 191\u2013222.","journal-title":"Linear Algebra and Its Applications"},{"issue":"3","key":"CR8","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I.J. Lustig","year":"1992","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cOn implementing Mehrotra's predictor\u2014corrector interior point method for linear programming\u201dSIAM Journal on Optimization 2(3) (1992) 435\u2013449.","journal-title":"SIAM Journal on Optimization"},{"key":"CR9","first-page":"107","volume-title":"Multi-Level Planning, Case Studies in Mexico","author":"A.S. Manne","year":"1973","unstructured":"A.S. Manne, \u201cDINAMICO, a dynamic multi-section multi-skill model,\u201d in: L.M. Goreux and A.S. Manne, editors,Multi-Level Planning, Case Studies in Mexico (North-Holland, Amsterdam, The Netherlands, 1973), pp. 107\u2013150."},{"key":"CR10","first-page":"151","volume-title":"Multi-Level Planning, Case Studies in Mexico","author":"A.S. Manne","year":"1973","unstructured":"A.S. Manne, \u201cEconomic alternatives for Mexico, a quantitative analysis,\u201d in: L.M. Goreux and A.S. Manne, editors,Multi-Level Planning, Case Studies in Mexico (North-Holland, Amsterdam, The Netherlands, 1973) pp. 151\u2013172."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, editor,Progress in Mathematical Programming: Interior Point and Related Methods (Springer Verlag, New York, 1989) pp. 131\u2013158."},{"issue":"4","key":"CR12","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, \u201cOn the implementation of a (primal-dual) interior point method,\u201dSIAM Journal on Optimization 2(4) (1992) 575\u2013601.","journal-title":"SIAM Journal on Optimization"},{"key":"CR13","volume-title":"\u201cThe nonlinear rescaling principle in linear programming,\u201d Technical Report RC 15030 (67093)","author":"R. Polyak","year":"1989","unstructured":"R. Polyak, \u201cThe nonlinear rescaling principle in linear programming,\u201d Technical Report RC 15030 (67093), Mathematical Sciences Department, IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, USA, 1989."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581140.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581140\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:15Z","timestamp":1556896335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["BF01581140"],"URL":"https:\/\/doi.org\/10.1007\/bf01581140","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}