{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T00:53:58Z","timestamp":1726188838918},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0377-2217(97)00074-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:10:52Z","timestamp":1027624252000},"page":"720-736","source":"Crossref","is-referenced-by-count":17,"title":["The role of the augmented system in interior point methods"],"prefix":"10.1016","volume":"107","author":[{"given":"Istv\u00e1n","family":"Maros","sequence":"first","affiliation":[]},{"given":"Csaba","family":"M\u00e9sz\u00e1ros","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00074-X_BIB1","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/BF01389335","article-title":"On the augmented system approach to sparse least-squares problems","volume":"55","author":"Arioli","year":"1989","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0167-6377(92)90024-W","article-title":"Prior reduced fillin solving equations in interior point algorithms","volume":"11","author":"Birge","year":"1992","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/S0377-2217(97)00074-X_BIB3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.6.1.15","article-title":"Progress in Linear Programming","volume":"6","author":"Bixby","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1093\/imanum\/11.2.181","article-title":"The factorization of sparse symmetric indefinite matrices","volume":"11","author":"Duff","year":"1991","journal-title":"IMA Journal of Numerical Analysis"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01585158","article-title":"Solving symmetric indefinite systems in an interior point method for linear programming","volume":"62","author":"Fourer","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB6","first-page":"10","article-title":"Electronic mail distribution of linear programming test problems","volume":"13","author":"Gay","year":"1985","journal-title":"Mathematical Programming Society COAL Newsletter"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1080\/02331939208843796","article-title":"Splitting dense columns of constraint matrix in interior point methods for large scale linear programming","volume":"24","author":"Gondzio","year":"1992","journal-title":"Optimization"},{"issue":"2","key":"10.1016\/S0377-2217(97)00074-X_BIB8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","article-title":"Path following methods for linear programming","volume":"34","author":"Gonzaga","year":"1992","journal-title":"SIAM Review"},{"issue":"3&4","key":"10.1016\/S0377-2217(97)00074-X_BIB9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/10637199408915470","article-title":"Solving large scale linear programming problems using an interior point method on a massively parallel SIMD computer","volume":"4","author":"Hafsteinsson","year":"1994","journal-title":"Journal of Parallel Algorithms and Applications"},{"issue":"1","key":"10.1016\/S0377-2217(97)00074-X_BIB10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1287\/ijoc.4.1.38","article-title":"Exploiting special structure in primal dual interior point methods","volume":"4","author":"Hurd","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","article-title":"Computational experience with a primal-dual interior point method for Linear Programming","volume":"152","author":"Lustig","year":"1991","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","article-title":"on implementing Mehrotra's predictor-corrector interior point method for Linear Programming","volume":"2","author":"Lustig","year":"1992","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"10.1016\/S0377-2217(97)00074-X_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","article-title":"Interior point methods for linear programming: computational state of the art","volume":"6","author":"Lustig","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB14","series-title":"Recent Advances in Linear and Integer Programming","first-page":"1","article-title":"Simplex algorithms","author":"Maros","year":"1996"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.1.4.287","article-title":"Implementation of a dual affine interior point algorithm for Linear Programming","volume":"1","author":"Marsten","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB16","article-title":"Handling free variables in interior methods","author":"Mehrotra","year":"1991"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB17","series-title":"LORDS WP 94-5","article-title":"Fast Cholesky factorization for interior point methods of linear programming","author":"Meszaros","year":"1994"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB18","series-title":"Optimization in Industrial Environments","first-page":"139","article-title":"Solution of large linear programs: a review of hardware, software and algorithmic issues","author":"Mitra","year":"1993"},{"issue":"1","key":"10.1016\/S0377-2217(97)00074-X_BIB19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/ijoc.6.1.23","article-title":"Major Cholesky would feel proud","volume":"6","author":"Saunders","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB20","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1090\/S0025-5718-1974-0343559-8","article-title":"Modifying pivot elements in Gaussian elimination","volume":"28","author":"Stewart","year":"1974","journal-title":"Mathematics of Computation"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB21","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01580755","article-title":"Exploiting special structure in Karmarkar's linear programming algorithm","volume":"41","author":"Todd","year":"1988","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0024-3795(91)90272-X","article-title":"Computing projections for the Karmarkar algorithm","volume":"152","author":"Turner","year":"1991","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"10.1016\/S0377-2217(97)00074-X_BIB23","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.5.2.134","article-title":"ALPO: Another Linear Program Optimizer","volume":"3","author":"Vanderbei","year":"1993","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB24","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","article-title":"A modification of Karmarkar's linear programming algorithm","volume":"1","author":"Vanderbei","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01581257","article-title":"Symmetric indefinite systems for interior point methods","volume":"58","author":"Vanderbei","year":"1993","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/S0377-2217(97)00074-X_BIB26","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/ijoc.6.1.32","article-title":"Interior-point methods: algorithms and formulations","volume":"6","author":"Vanderbei","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00074-X_BIB27","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01582276","article-title":"Affine scaling for linear programs with free variables","volume":"43","author":"Vanderbei","year":"1989","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700074X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700074X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T23:50:10Z","timestamp":1555977010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179700074X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S037722179700074X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00074-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}