{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T00:25:55Z","timestamp":1773534355505,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993,1]]},"DOI":"10.1007\/bf01581257","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:48:26Z","timestamp":1114681706000},"page":"1-32","source":"Crossref","is-referenced-by-count":114,"title":["Symmetric indefinite systems for interior point methods"],"prefix":"10.1007","volume":"58","author":[{"given":"Robert J.","family":"Vanderbei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamra J.","family":"Carpenter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, \u201cAn implementation of Karmarkar's algorithm for linear programming,\u201dMathematical Programming 44 (1989) 297\u2013335.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, \u201cA variation on Karmarkar's algorithm for solving linear programming problems,\u201dMathematical Programming 36 (1986) 174\u2013182.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0708060","volume":"8","author":"J.R. Bunch","year":"1971","unstructured":"J.R. Bunch and B.N. Parlett, \u201cDirect methods for solving symmetric indefinite systems of linear equations,\u201dSIAM Journal on Numerical Analysis 8 (1971) 639\u2013655.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR4","unstructured":"T. J. Carpenter, I.J. Lustig, J.M. Mulvey and D.F. Shanno, \u201cSeparable quadratic programming via a primal-dual interior point method and its use in a sequential procedure,\u201d to appear in:ORSA Journal on Computing."},{"key":"CR5","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201dSoviet Mathematics Doklady 8 (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR6","first-page":"26","volume":"19","author":"R. Fourer","year":"1991","unstructured":"R. Fourer and S. Mehrotra, \u201cPerformance of an augmented system approach for solving least-squares problems in an interior point method for linear programming,\u201dMathematical Programming Society COAL Newsletter 19 (1991) 26\u201331.","journal-title":"Mathematical Programming Society COAL Newsletter"},{"key":"CR7","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201dMathematical Programming Society COAL Newsletter 13 (1985) 10\u201312.","journal-title":"Mathematical Programming Society COAL Newsletter"},{"key":"CR8","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"A. George and J. Liu,Computer Solution of Large Sparse Positive Definite Systems (Prentice-Hall, Englewood Cliffs, NJ, 1981)."},{"key":"CR9","volume-title":"\u201cPreconditioners for indefinite systems arising in optimization,\u201d Technical Report SOL 90-8","author":"P.E. Gill","year":"1990","unstructured":"P.E. Gill, W. Murray, D.B. Poncele\u00f3n and M.A. Saunders, \u201cPreconditioners for indefinite systems arising in optimization,\u201d Technical Report SOL 90-8, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1990)."},{"key":"CR10","volume-title":"Numerical Linear Algebra and Optimization, Vol. 1","author":"P.E. Gill","year":"1991","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Numerical Linear Algebra and Optimization, Vol. 1 (Addison-Wesley, Redwood City, CA, 1991)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR12","volume-title":"\u201cA fast algorithm for solving large scale mean-variance models by compact factorization of covariance matrices,\u201d Report IHSS 91-32","author":"H. Konno","year":"1991","unstructured":"H. Konno and K. Suzuki, \u201cA fast algorithm for solving large scale mean-variance models by compact factorization of covariance matrices,\u201d Report IHSS 91-32, Institute of Human and Social Sciences, Tokyo Institute of Technology (Tokyo, 1991)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, \u201cFeasibility issues in a primal\u2014dual interior point method for linear programming,\u201dMathematical Programming 49 (1991) 145\u2013162.","journal-title":"Mathematical Programming"},{"key":"CR14","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. 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"},{"key":"CR15","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 (1992) 435\u2013449.","journal-title":"SIAM Journal on Optimization"},{"key":"CR16","volume-title":"Portfolio Selection: Efficient Diversification of Investments","author":"H.M. Markowitz","year":"1959","unstructured":"H.M. Markowitz,Portfolio Selection: Efficient Diversification of Investments (Wiley, New York, 1959)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.1.4.287","volume":"1","author":"R.E. Marsten","year":"1989","unstructured":"R.E. Marsten, M.J. Saltzman, D.F. Shanno, G.S. Pierce and J.F. Ballintijn, \u201cImplementation of a dual affine interior point algorithm for linear programming,\u201dORSA Journal on Computing 1 (1989) 287\u2013297.","journal-title":"ORSA Journal on Computing"},{"key":"CR18","volume-title":"\u201cOn the implementation of a (primal-dual) interior point method,\u201d Technical Report 90-03","author":"S. Mehrotra","year":"1990","unstructured":"S. Mehrotra, \u201cOn the implementation of a (primal-dual) interior point method,\u201d Technical Report 90-03, Department of Industrial Engineering and Management Sciences, Northwestern University (Evanston, IL, 1990)."},{"key":"CR19","volume-title":"\u201cHandling free variables in interior point methods,\u201d Technical Report 91-06","author":"S. Mehrotra","year":"1991","unstructured":"S. Mehrotra, \u201cHandling free variables in interior point methods,\u201d Technical Report 91-06, Department of Industrial Engineering and Management Sciences, Northwestern University (Evanston, IL, 1991)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal\u2014dual algorithms. Part I: Linear programming,\u201dMathematical Programming 44 (1989) 27\u201342.","journal-title":"Mathematical Programming"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal\u2014dual algorithms. Part II: Convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"CR22","volume-title":"\u201cMINOS 5.1 user's guide,\u201d Technical Report SOL 83-20R","author":"B.A. Murtagh","year":"1987","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMINOS 5.1 user's guide,\u201d Technical Report SOL 83-20R, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1987)."},{"key":"CR23","volume-title":"Barrier methods for large-scale quadratic programming","author":"D.B. Poncel\u00e9on","year":"1990","unstructured":"D.B. Poncel\u00e9on, \u201cBarrier methods for large-scale quadratic programming,\u201d Ph.D. Thesis, Stanford University (Stanford, CA, 1990)."},{"key":"CR24","volume-title":"\u201cALPO: Another linear program optimizer,\u201d Technical Report","author":"R.J. Vanderbei","year":"1990","unstructured":"R.J. Vanderbei, \u201cALPO: Another linear program optimizer,\u201d Technical Report, AT&T Bell Laboratories (Murray Hill, NJ, 1990)."},{"key":"CR25","volume-title":"\u201cA brief description of ALPO,\u201d Technical Report","author":"R.J. Vanderbei","year":"1990","unstructured":"R.J. Vanderbei, \u201cA brief description of ALPO,\u201d Technical Report, AT&T Bell Laboratories (Murray Hill, NJ, 1990)."},{"key":"CR26","volume-title":"\u201cSymmetric quasi-definite matrices,\u201d Technical Report SOR-91-10","author":"R.J. Vanderbei","year":"1991","unstructured":"R.J. Vanderbei, \u201cSymmetric quasi-definite matrices,\u201d Technical Report SOR-91-10, Department of Civil Engineering and Operations Research, Princeton University (Princeton, NJ, 1991)."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon and B.F. Freedman, \u201cA modification of Karmarkar's linear programming algorithm,\u201dAlgorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581257.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581257\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:16Z","timestamp":1556896336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["BF01581257"],"URL":"https:\/\/doi.org\/10.1007\/bf01581257","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}