{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T13:53:48Z","timestamp":1770472428349,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1023\/a:1016614603137","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T18:09:18Z","timestamp":1041185358000},"page":"387-406","source":"Crossref","is-referenced-by-count":22,"title":["Adaptive use of iterative methods in predictor\u2013corrector interior point methods for linear programming"],"prefix":"10.1007","volume":"25","author":[{"given":"Weichung","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dianne P.","family":"O'Leary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"318450_CR1","series-title":"Technical Report 1996.3","volume-title":"Implementation of interior point methods for large scale linear programming","author":"E.D. Andersen","year":"1997","unstructured":"E.D. Andersen, J. Gondzio, C. M\u00e9sz\u00e1ros and X. Xu, Implementation of interior point methods for large scale linear programming, Technical Report 1996.3, Logilab, HEC Geneva, Section of Management Studies, University of Geneva, Switzerland (January 1997)."},{"issue":"4","key":"318450_CR2","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/0610041","volume":"10","author":"R. Bartels","year":"1989","unstructured":"R. Bartels and L. Kaufman, Cholesky factor updating techniques for rank 2 matrix modifications, SIAM J. Matrix Anal. Appl. 10(4) (1989) 557\u2013592.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"318450_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01299140","volume":"2","author":"T.J. Carpenter","year":"1993","unstructured":"T.J. Carpenter and D.F. Shanno, An interior point method for quadratic programs based on conjugate projected gradients, Comput. Optim. Appl. 2 (1993) 5\u201328.","journal-title":"Comput. Optim. Appl."},{"key":"318450_CR4","unstructured":"P. Chin and A. Vannelli, Computational methods for an LP model of the placement problem, Technical Report UWE&CE\u201394\u201302, Department of Electrical and Computer Engineering, University of Waterloo (November 1994)."},{"key":"318450_CR5","unstructured":"P. Chin and A. Vannelli, Iterative methods for the augmented equations in large-scale linear programming, Technical Report UWE&CE\u201394\u201301, Department of Electrical and Computer Engineering, University of Waterloo (October 1994)."},{"issue":"4","key":"318450_CR6","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1287\/ijoc.2.4.304","volume":"2","author":"I.C. Choi","year":"1990","unstructured":"I.C. Choi, C.L. Monma and D.F. Shanno, Further development of a primal-dual interior point method, ORSA J. Comput. 2(4) (1990) 304\u2013311.","journal-title":"ORSA J. Comput."},{"key":"318450_CR7","series-title":"Technical Report ANL\/MCS-TM-217","doi-asserted-by":"crossref","DOI":"10.2172\/475586","volume-title":"PCx user guide","author":"J. Czyzyk","year":"1997","unstructured":"J. Czyzyk, S. Mehrotra and S.J. Wright, PCx user guide, Technical Report ANL\/MCS-TM-217, Argonne National Laboratory, Argonne, IL (1997)."},{"key":"318450_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971811","volume-title":"LINPACK User's Guide","author":"J.J. Dongarra","year":"1979","unstructured":"J.J. Dongarra, J.R. Bunch, C.B. Moler and G.W. Stewart, LINPACK User's Guide (SIAM, Philadelphia, PA, 1979)."},{"key":"318450_CR9","volume-title":"Direct Methods for Sparse Matrices","author":"I.S. Duff","year":"1986","unstructured":"I.S. Duff, A.M. Erisman and J.K. Reid, Direct Methods for Sparse Matrices (Clarendon Press, Oxford, 1986)."},{"key":"318450_CR10","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 (Wiley, New York, 1968). Reprint: SIAMClassics in Applied Mathematics, Vol. 4 (SIAM Philadelphia, PA, 1990)."},{"key":"318450_CR11","unstructured":"R.W. Freund and F. Jarre, A QMR-based interior-point algorithm for solving linear programs, Technical Report, AT&T Bell Laboratories and Institut f\u00fcr Angewandte Mathematik und Statistik (1995)."},{"key":"318450_CR12","doi-asserted-by":"crossref","unstructured":"M. Frigo and S.G. Johnson, The fastest Fourier transform in the west, Technical Report MIT-LCSTR-728, Massachusetts Institute of Technology (September 1997).","DOI":"10.21236\/ADA479065"},{"key":"318450_CR13","unstructured":"D.M. Gay, Electronic mail distribution of linear programming test problems, Mathematical Programming Soc. COAL Newsletter (1985)."},{"key":"318450_CR14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF01585529","volume":"7","author":"P.E. Gill","year":"1974","unstructured":"P.E. Gill and W. Murray, Newton-type methods for unconstrained and linearly constrained optimization, Math. Programming 7 (1974) 311\u2013350.","journal-title":"Math. Programming"},{"key":"318450_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method, Math. Programming 36 (1986) 183\u2013209.","journal-title":"Math. Programming"},{"key":"318450_CR16","volume-title":"Practical Optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H. Wright, Practical Optimization (Academic Press, New York, 1981)."},{"issue":"3","key":"318450_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01580737","volume":"40","author":"D. Goldfarb","year":"1988","unstructured":"D. Goldfarb and S. Mehrotra, A relaxed version of Karmarkar's method, Math. Programming 40(3) (1988) 289\u2013315.","journal-title":"Math. Programming"},{"key":"318450_CR18","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"G.H. Golub and C.F. Van Loan, Matrix Computations, 2nd ed. (Johns Hopkins Univ. Press, Baltimore, MD, 1989).","edition":"2nd ed."},{"issue":"2","key":"318450_CR19","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 Rev. 34(2) (1992) 167\u2013224.","journal-title":"SIAM Rev."},{"key":"318450_CR20","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":"318450_CR21","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01582905","volume":"52","author":"N.K. Karmarkar","year":"1991","unstructured":"N.K. Karmarkar and K.G. Ramakrishnan, Computational results of an interior point algorithm for large scale linear programming, Math. Programming 52 (1991) 555\u2013586.","journal-title":"Math. Programming"},{"key":"318450_CR22","volume-title":"Algorithms for Network Programming","author":"J.L. Kennington","year":"1980","unstructured":"J.L. Kennington and R.V. Helgason, Algorithms for Network Programming (Wiley, New York, 1980)."},{"issue":"5","key":"318450_CR23","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"D. Klingman, A. Napier and J. Stutz, NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems, Managm. Sci. 20(5) (1974) 814\u2013821.","journal-title":"Managm. Sci"},{"key":"318450_CR24","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"J. Liu","year":"1985","unstructured":"J. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Software 11 (1985) 141\u2013153.","journal-title":"ACM Trans. Math. Software"},{"key":"318450_CR25","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, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl. 152 (1991) 191\u2013222.","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"318450_CR26","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, On implementing Mehrotra's predictor-corrector interiorpoint method for linear programming, SIAM J. Optim. 2(3) (1992) 435\u2013449.","journal-title":"SIAM J. Optim."},{"issue":"1","key":"318450_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"I.J. Lustig","year":"1994","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, Interior point methods for linear programming: Computational state of the art, ORSA J. Comput. 6(1) (1994) 1\u201314.","journal-title":"ORSA J. Comput."},{"issue":"2","key":"318450_CR28","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/ijoc.4.2.103","volume":"4","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, Implementation of affine scaling methods: Approximate solutions of systems of linear equations using preconditioned conjugate gradient methods, ORSA J. Comput. 4(2) (1992) 103\u2013118.","journal-title":"ORSA J. Comput."},{"issue":"4","key":"318450_CR29","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM J. Optim. 2(4) (1992) 575\u2013601.","journal-title":"SIAM J. Optim."},{"key":"318450_CR30","series-title":"Technical Report 95\u201370.1","volume-title":"Conjugate gradient based implementation of interior point methods for network flow problems","author":"S. Mehrotra","year":"1995","unstructured":"S. Mehrotra and J.-S. Wang, Conjugate gradient based implementation of interior point methods for network flow problems, Technical Report 95\u201370.1, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL (October 1995)."},{"key":"318450_CR31","series-title":"Technical Report 93\u201301","volume-title":"Preconditioning of reduced matrices","author":"S.G. Nash","year":"1993","unstructured":"S.G. Nash and A. Sofer, Preconditioning of reduced matrices, Technical Report 93\u201301, Department of Operations Research and Engineering, George Mason University, Fairfax, VA (February 1993)."},{"key":"318450_CR32","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0914063","volume":"14","author":"E. Ng","year":"1993","unstructured":"E. Ng and B.W. Peyton, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Comput. 14 (1993) 1034\u20131056.","journal-title":"SIAM J. Sci. Comput."},{"key":"318450_CR33","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"C.C. Paige","year":"1982","unstructured":"C.C. Paige and M.A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software 8 (1982) 43\u201371.","journal-title":"ACM Trans. Math. Software"},{"key":"318450_CR34","unstructured":"L.F. Portugal, M.G.C. Resende, G. Veiga and J.J. J\u00dadice, A truncated primal-infeasible dual-feasible network interior point method (November 1994)."},{"key":"318450_CR35","unstructured":"R.J. Vanderbei, LOQO: An interior point code for quadratic programming, Program in Statistics and Operations Research, Princeton University, rvdb@princeton.edu (1995)."},{"key":"318450_CR36","first-page":"121","volume-title":"Problems in Differential Equations","author":"R.S. Varga","year":"1960","unstructured":"R.S. Varga, Factorization and normalized iterative methods, in: Boundary Problems in Differential Equations, ed. R.E. Langer (Univ. of Wisconsin Press, Madison, 1960) pp. 121\u2013142."},{"key":"318450_CR37","unstructured":"W. Wang, Iterative methods in interior point methods for linear programming, Ph.D. thesis, Applied Mathematics Program, University of Maryland (1996)."},{"key":"318450_CR38","unstructured":"W. Wang and D.P. O'Leary, Adaptive use of iterative methods in interior point methods for linear programming, Technical Report CS-TR-3560, Computer Science Department, University of Maryland (November 1995); http:\/\/www.cs.umd.edu\/Dienst\/UI\/2.0\/Describe\/ncstrl.umcp\/CS-TR-3560."},{"key":"318450_CR39","volume-title":"SC 1998 Proceedings","author":"R.C. Whaley","year":"1998","unstructured":"R.C. Whaley and J.J. Dongarra, Automatically tuned linear algebra software, in: SC 1998 Proceedings (IEEE Press, New York, 1998) (electronic publication); http:\/\/www.netlib.org\/utk\/people\/JackDongarra\/papers.html."},{"key":"318450_CR40","first-page":"341","volume-title":"Acta Numerica 1992","author":"M.H. Wright","year":"1992","unstructured":"M.H. Wright, Interior methods for constrained optimization, in: Acta Numerica 1992, ed. A. Iserles (Cambridge Univ. Press, New York, 1992) pp. 341\u2013407."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016614603137.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016614603137\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016614603137.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:18:19Z","timestamp":1751872699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016614603137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":40,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["318450"],"URL":"https:\/\/doi.org\/10.1023\/a:1016614603137","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}