{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:05:48Z","timestamp":1765886748357,"version":"3.41.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1021882330897","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T18:56:02Z","timestamp":1048272962000},"page":"5-35","source":"Crossref","is-referenced-by-count":15,"title":["A Study of Preconditioners for Network Interior Point Methods"],"prefix":"10.1007","volume":"24","author":[{"given":"Joaquim J.","family":"J\u00fadice","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Patricio","sequence":"additional","affiliation":[]},{"given":"Luis F.","family":"Portugal","sequence":"additional","affiliation":[]},{"given":"Mauricio G.C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"Geraldo","family":"Veiga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5110701_CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1.2.84","volume":"1","author":"I. Adler","year":"1989","unstructured":"I. Adler, N. Karmarkar, M. Resende, and G. Veiga, \u201cData structures and programming techniques for the implementation of Karmarkar's algorithm,\u201d ORSA Journal on Computing, vol. 1, pp. 84\u2013106, 1989.","journal-title":"ORSA Journal on Computing"},{"key":"5110701_CR2","unstructured":"N.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall: Englewood Cliffs, NJ, 1993."},{"key":"5110701_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624100","volume-title":"Iterative Solution Methods","author":"O. Axelsson","year":"1994","unstructured":"O. Axelsson, Iterative Solution Methods, Cambridge: Cambridge University Press, 1994."},{"key":"5110701_CR4","series-title":"Technical report","volume-title":"On the convergence of an inexact primal-dual interior point method for linear programming","author":"V. Baryamureeba","year":"2000","unstructured":"V. Baryamureeba and T. Steihaugh, \u201cOn the convergence of an inexact primal-dual interior point method for linear programming,\u201d Technical report, Department of Informatics-University of Bergen, Bergen-Norway, 2000."},{"key":"5110701_CR5","series-title":"Technical report","volume-title":"An inexact interior-point method for monotone NCP","author":"S. Bellavia","year":"1999","unstructured":"S. Bellavia and M. Maconni, \u201cAn inexact interior-point method for monotone NCP,\u201d Technical report, University of Firenze, Italy, 1999."},{"key":"5110701_CR6","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"R.S. Dembo","year":"1982","unstructured":"R.S. Dembo, S.C. Eisenstat, and T. Steihaug, \u201cInexact newton methods,\u201d SIAM Journal on Numerical Analysis, vol. 19, pp. 400\u2013408, 1982.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"5110701_CR7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"R.S. Dembo","year":"1983","unstructured":"R.S. Dembo and T. Steihaug, \u201cTruncated-Newton algorithms for large scale unconstrained optimization,\u201d Mathematical Programming, vol. 26, pp. 190\u2013212, 1983.","journal-title":"Mathematical Programming"},{"key":"5110701_CR8","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Technique","author":"A. Fiacco","year":"1968","unstructured":"A. Fiacco and G. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Technique, Wiley: New York, 1968."},{"key":"5110701_CR9","unstructured":"R. Freund, F. Jarre, and S. Mizuno, \u201cConvergence of a class of inexact interior-point algorithms for linear programs,\u201d Technical report, Lucent Technologies, 600 Mountain Avenue, Murray Hill, New Jersey 07974, USA, 1996."},{"key":"5110701_CR10","volume-title":"Matrix Computations","author":"G. Golub","year":"1989","unstructured":"G. Golub and C. van Loan, Matrix Computations, The Johns Hopkins University Press: Baltimore, MD, 1989."},{"key":"5110701_CR11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02096259","volume":"46","author":"O. Guler","year":"1993","unstructured":"O. Guler, D. den Hertog, C. Roos, T. Terlaky, and T. Tsuchiya, \u201cDegeneracy in interior point methods for linear programming: A survey,\u201d Annals of Operations Research, vol. 46, pp. 107\u2013138, 1993.","journal-title":"Annals of Operations Research"},{"key":"5110701_CR12","doi-asserted-by":"crossref","unstructured":"D. Johnson and C. McGeoch (Eds.). Network Flows and Matching: First DIMACS Implementation Challenge, vol. 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1993.","DOI":"10.1090\/dimacs\/012"},{"key":"5110701_CR13","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-dual infeasible-interior-point algorithm for linear programming,\u201d Mathematical Programming, vol. 61, pp. 263\u2013280, 1993.","journal-title":"Mathematical Programming"},{"key":"5110701_CR14","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","volume":"1","author":"K. McShane","year":"1989","unstructured":"K. McShane, C. Monma, and D. Shanno, \u201cAn implementation of a primal-dual interior point method for linear programming,\u201d ORSA Journal on Computing, vol. 1, pp. 70\u201383, 1989.","journal-title":"ORSA Journal on Computing"},{"key":"5110701_CR15","first-page":"131","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 Progress in Mathematical Programming, Interior Point and Related Methods, N. Megiddo (Ed.), Springer: New York, 1989, pp. 131\u2013158."},{"key":"5110701_CR16","unstructured":"L. Adams and J. Nazareth (Eds.), SIAM, Philadelphia, 1996, pp. 124\u2013142."},{"key":"5110701_CR17","series-title":"Research Memorandum","volume-title":"Global and polynomial time convergence of an infeasible interior point algorithm using inexact computation","author":"S. Mizuno","year":"1996","unstructured":"S. Mizuno and F. Jarre, \u201cGlobal and polynomial time convergence of an infeasible interior point algorithm using inexact computation,\u201d Research Memorandum 605, Institute of Statistical Mathematics, Tokyo, USA, 1996."},{"key":"5110701_CR18","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1137\/S1064827593258280","volume":"17","author":"L. Portugal","year":"1996","unstructured":"L. Portugal, F. Bastos, J. Judice, J. Paix\u00e3o, and T. Terlaky, \u201cAn investigation of interior point algorithms for the linear transportation problem,\u201d SIAM Journal on Scientific Computing, vol. 17, pp. 1202\u20131223, 1996.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"5110701_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T","volume":"35","author":"L. Portugal","year":"2000","unstructured":"L. Portugal, M. Resende, G. Veiga, and J. Judice, \u201cA truncated primal-infeasible dual-feasible interior point network flow method,\u201d Networks, vol. 35, pp. 91\u2013108, 2000.","journal-title":"Networks"},{"key":"5110701_CR20","doi-asserted-by":"crossref","unstructured":"M. Resende and G. Veiga, \u201cAn efficient implementation of a network interior point method,\u201d in Network Flows and Matching: First DIMACS Implementation Challenge, D.S. Johnson and C.C. McGeoch (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, American Mathematical Society, pp. 299\u2013348, 1993a.","DOI":"10.1090\/dimacs\/012\/12"},{"key":"5110701_CR21","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/0803025","volume":"3","author":"M. Resende","year":"1993","unstructured":"M. Resende and G. Veiga, \u201cAn implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks,\u201d SIAM Journal on Optimization, vol. 3, pp. 516\u2013537, 1993b.","journal-title":"SIAM Journal on Optimization"},{"key":"5110701_CR22","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons: New York, 1986."},{"key":"5110701_CR23","unstructured":"S. Wright, \u201cStability of linear algebra computations in interior point methods for linear programming,\u201d Preprint ANL\/MCS-P446-0694, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, USA, 1994."},{"key":"5110701_CR24","unstructured":"S. Wright, \u201cModified cholesky factorizations in interior point algorithms for linear programming,\u201d Preprint ANL\/MCS-P600-0596, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, USA, 1996."},{"key":"5110701_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal Dual Interior Point Methods","author":"S. Wright","year":"1997","unstructured":"S. Wright, Primal Dual Interior Point Methods. SIAM: Philaldelphia, 1997."},{"key":"5110701_CR26","volume-title":"A reduced dual affine scaling algorithm for solving assignment and transportation problems","author":"Q.-J. Yeh","year":"1989","unstructured":"Q.-J. Yeh, \u201cA reduced dual affine scaling algorithm for solving assignment and transportation problems,\u201d Ph.D. Thesis, Columbia University, New York, 1989."},{"key":"5110701_CR27","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Y. Zhang, \u201cOn the convergenvce of a class of infeasible interior point methods for the horizontal linear complementarity problem,\u201d SIAM Journal on Optimization, vol. 4, pp. 208\u2013227, 1994.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021882330897.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021882330897\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021882330897.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:35:01Z","timestamp":1752377701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021882330897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5110701"],"URL":"https:\/\/doi.org\/10.1023\/a:1021882330897","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}