{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:18:06Z","timestamp":1764937086886,"version":"3.37.3"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:00:00Z","timestamp":1559779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:00:00Z","timestamp":1559779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["16K17639","15H02968"],"award-info":[{"award-number":["16K17639","15H02968"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K04768","15H02968"],"award-info":[{"award-number":["15K04768","15H02968"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10589-019-00103-y","type":"journal-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:03:21Z","timestamp":1559833401000},"page":"143-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4584-4309","authenticated-orcid":false,"given":"Yiran","family":"Cui","sequence":"first","affiliation":[]},{"given":"Keiichi","family":"Morikuni","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Tsuchiya","sequence":"additional","affiliation":[]},{"given":"Ken","family":"Hayami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,6]]},"reference":[{"issue":"1\u20133","key":"103_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I Adler","year":"1989","unstructured":"Adler, I., Resende, M.G.C., Veiga, G., Karmarkar, N.: An implementation of Karmarkar\u2019s algorithm for linear programming. Math. Program. 44(1\u20133), 297\u2013335 (1989). https:\/\/doi.org\/10.1007\/BF01587095","journal-title":"Math. Program."},{"issue":"2","key":"103_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10957-008-9500-5","volume":"141","author":"G Al-Jeiroudi","year":"2009","unstructured":"Al-Jeiroudi, G., Gondzio, J.: Convergence analysis of the inexact infeasible interior-point method for linear optimization. J. Optim. Theory Appl. 141(2), 231\u2013247 (2009). https:\/\/doi.org\/10.1007\/s10957-008-9500-5","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"103_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1080\/10556780701535910","volume":"23","author":"G Al-Jeiroudi","year":"2008","unstructured":"Al-Jeiroudi, G., Gondzio, J., Hall, J.: Preconditioning indefinite systems in interior point methods for large scale linear optimisation. Optim. Method Softw. 23(3), 345\u2013363 (2008). https:\/\/doi.org\/10.1080\/10556780701535910","journal-title":"Optim. Method Softw."},{"issue":"2","key":"103_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF01586000","volume":"71","author":"ED Andersen","year":"1995","unstructured":"Andersen, E.D., Andersen, K.D.: Presolving in linear programming. Math. Program. 71(2), 221\u2013245 (1995). https:\/\/doi.org\/10.1007\/BF01586000","journal-title":"Math. Program."},{"key":"103_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-3449-1_6","volume-title":"Interior Point Methods of Mathematical Programming, App. Optim.","author":"ED Andersen","year":"1996","unstructured":"Andersen, E.D., Gondzio, J., M\u00e9sz\u00e1ros, C., Xu, X.: Implementation of interior-point methods for large scale linear programs. In: Pardalos, P.M., Hearn, D. (eds.) Interior Point Methods of Mathematical Programming, App. Optim., vol. 5. Kluwer Academic Publishers, Dordrecht (1996). https:\/\/doi.org\/10.1007\/978-1-4613-3449-1_6"},{"issue":"2\u20133","key":"103_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10589-006-9001-0","volume":"36","author":"L Bergamaschi","year":"2007","unstructured":"Bergamaschi, L., Gondzio, J., Venturin, M., Zilli, G.: Inexact constraint preconditioners for linear systems arising in interior point methods. Comput. Optim. Appl. 36(2\u20133), 137\u2013147 (2007). https:\/\/doi.org\/10.1007\/s10589-006-9001-0","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"103_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/B:COAP.0000026882.34332.1b","volume":"28","author":"L Bergamaschi","year":"2004","unstructured":"Bergamaschi, L., Gondzio, J., Zilli, G.: Preconditioning indefinite systems in interior point methods for optimization. Comput. Optim. Appl. 28(2), 149\u2013171 (2004). https:\/\/doi.org\/10.1023\/B:COAP.0000026882.34332.1b","journal-title":"Comput. Optim. Appl."},{"key":"103_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01930845","volume":"19","author":"\u00c5 Bj\u00f6rck","year":"1979","unstructured":"Bj\u00f6rck, \u00c5., Elfving, T.: Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations. BIT 19, 145\u2013163 (1979). https:\/\/doi.org\/10.1007\/BF01930845","journal-title":"BIT"},{"issue":"1","key":"103_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01299140","volume":"2","author":"TJ Carpenter","year":"1993","unstructured":"Carpenter, T.J., Shanno, D.F.: An interior point method for quadratic programs based on conjugate projected gradients. Comput. Optim. Appl. 2(1), 5\u201328 (1993). https:\/\/doi.org\/10.1007\/BF01299140","journal-title":"Comput. Optim. Appl."},{"key":"103_CR10","unstructured":"Chen, S., Donoho, D., Saunders, M.: About atomizer (2000). http:\/\/sparselab.stanford.edu\/atomizer\/ . Accessed 27 May 2019"},{"issue":"1","key":"103_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"S Chen","year":"2001","unstructured":"Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001). https:\/\/doi.org\/10.1137\/S003614450037906X","journal-title":"SIAM Rev."},{"key":"103_CR12","doi-asserted-by":"publisher","unstructured":"Chin, P., Vannelli, A.: PCG techniques for interior point algorithms. In: Proceedings of the 36th Midwest Symposium on Circuits and Systems, pp. 200\u2013203. IEEE (1994). https:\/\/doi.org\/10.1109\/MWSCAS.1993.343095","DOI":"10.1109\/MWSCAS.1993.343095"},{"key":"103_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1002\/sapm195534164","volume":"34","author":"EJ Craig","year":"1955","unstructured":"Craig, E.J.: The $${N}$$-step iteration procedures. J. Math. Phys. 34, 64\u201373 (1955). https:\/\/doi.org\/10.1002\/sapm195534164","journal-title":"J. Math. Phys."},{"key":"103_CR14","unstructured":"Cui, X.: Approximate Generalized Inverse Preconditioning Methods for Least Squares Problems. Ph.D. thesis, The Graduate University for Advanced Studies, Japan (2009). http:\/\/id.nii.ac.jp\/1013\/00001492\/"},{"key":"103_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10444-011-9171-x","volume":"35","author":"X Cui","year":"2011","unstructured":"Cui, X., Hayami, K., Yin, J.F.: Greville\u2019s method for preconditioning least squares problems. Adv. Comput. Math. 35, 243\u2013269 (2011). https:\/\/doi.org\/10.1007\/s10444-011-9171-x","journal-title":"Adv. Comput. Math."},{"key":"103_CR16","unstructured":"Cui, Y., Morikuni, K., Tsuchiya, T., Hayami, K.: Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, pp. 1\u201330. arXiv prepr. arXiv:1604.07491 (2016)"},{"issue":"1\u20134","key":"103_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1080\/10556789908805757","volume":"11","author":"J Czyzyk","year":"1999","unstructured":"Czyzyk, J., Mehrotra, S., Wagner, M., Wright, S.J.: PCx: An interior-point code for linear programming. Optim. Methods Softw. 11(1\u20134), 397\u2013430 (1999). https:\/\/doi.org\/10.1080\/10556789908805757","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"103_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10589-008-9226-1","volume":"45","author":"M D\u2019Apuzzo","year":"2010","unstructured":"D\u2019Apuzzo, M., De Simone, V., Di Serafino, D.: On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods. Comput. Optim. Appl. 45(2), 283\u2013310 (2010). https:\/\/doi.org\/10.1007\/s10589-008-9226-1","journal-title":"Comput. Optim. Appl."},{"key":"103_CR19","unstructured":"Davis, T.A.: CSparse: A concise sparse matrix package. Version 3.1.4 (2014). http:\/\/www.suitesparse.com . Accessed 27 May 2019"},{"issue":"1","key":"103_CR20","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011). https:\/\/doi.org\/10.1145\/2049662.2049663","journal-title":"ACM Trans. Math. Softw."},{"key":"103_CR21","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1137\/1032122","volume":"32","author":"A Dax","year":"1990","unstructured":"Dax, A.: The convergence of linear stationary iterative processes for solving singular unstructured systems of linear equations. SIAM Rev. 32, 611\u2013635 (1990). https:\/\/doi.org\/10.1137\/1032122","journal-title":"SIAM Rev."},{"issue":"2","key":"103_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"issue":"2","key":"103_CR23","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/992200.992202","volume":"30","author":"IS Duff","year":"2004","unstructured":"Duff, I.S.: MA57\u2014A new code for the solution of sparse symmetric definite systems. ACM Trans. Math. Softw. 30(2), 118\u2013144 (2004). https:\/\/doi.org\/10.1145\/992200.992202","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"103_CR24","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1137\/S1052623400374379","volume":"13","author":"MC Ferris","year":"2002","unstructured":"Ferris, M.C., Munson, T.S.: Interior-point methods for massive support vector machines. SIAM J. Optim. 13(3), 783\u2013804 (2002). https:\/\/doi.org\/10.1137\/S1052623400374379","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"103_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01585158","volume":"62","author":"R Fourer","year":"1993","unstructured":"Fourer, R., Mehrotra, S.: Solving symmetric indefinite systems in an interior-point method for linear programming. Math. Program. 62(1\u20133), 15\u201339 (1993). https:\/\/doi.org\/10.1007\/BF01585158","journal-title":"Math. Program."},{"issue":"1","key":"103_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02614383","volume":"76","author":"RW Freund","year":"1997","unstructured":"Freund, R.W., Jarre, F.: A QMR-based interior-point algorithm for solving linear programs. Math. Program. 76(1), 183\u2013210 (1997). https:\/\/doi.org\/10.1007\/BF02614383","journal-title":"Math. Program."},{"issue":"1","key":"103_CR27","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/moor.24.1.50","volume":"24","author":"RW Freund","year":"1999","unstructured":"Freund, R.W., Jarre, F., Mizuno, S.: Convergence of a class of inexact interior-point algorithms for linear programs. Math. Oper. Res. 24(1), 50\u201371 (1999). https:\/\/doi.org\/10.1287\/moor.24.1.50","journal-title":"Math. Oper. Res."},{"issue":"2","key":"103_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"PE Gill","year":"1986","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Tomlin, J.A., Wright, M.H.: On projected Newton barrier methods for linear programming and an equivalence to Karmarkar\u2019s projective method. Math. Program. 36(2), 183\u2013209 (1986). https:\/\/doi.org\/10.1007\/BF02592025","journal-title":"Math. Program."},{"issue":"1","key":"103_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0377-2217(95)00163-K","volume":"85","author":"J Gondzio","year":"1995","unstructured":"Gondzio, J.: HOPDM (version 2.12)\u2014a fast LP solver based on a primal-dual interior point method. Eur. J. Oper. Res. 85(1), 221\u2013225 (1995). https:\/\/doi.org\/10.1016\/0377-2217(95)00163-K","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"103_CR30","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J Gondzio","year":"1996","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6(2), 137\u2013156 (1996). https:\/\/doi.org\/10.1007\/BF00249643","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"103_CR31","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/ijoc.9.1.73","volume":"9","author":"J Gondzio","year":"1997","unstructured":"Gondzio, J.: Presolve analysis of linear programs prior to applying an interior point method. INFORMS J. Comput. 9(1), 73\u201391 (1997). https:\/\/doi.org\/10.1287\/ijoc.9.1.73","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"103_CR32","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Interior point methods 25 years later. Eur. J. Oper. Res. 218(3), 587\u2013601 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2011.09.017","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"103_CR33","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10589-010-9361-3","volume":"51","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Matrix-free interior point method. Comput. Optim. Appl. 51(2), 457\u2013480 (2012). https:\/\/doi.org\/10.1007\/s10589-010-9361-3","journal-title":"Comput. Optim. Appl."},{"key":"103_CR34","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1093\/oso\/9780198538561.003.0003","volume-title":"Advances in Linear and Integer Programming","author":"J Gondzio","year":"1996","unstructured":"Gondzio, J., Terlaky, T.: A computational view of interior point methods. In: Beasley, J.E. (ed.) Advances in Linear and Integer Programming, pp. 103\u2013144. Oxford University Press, Oxford (1996)"},{"key":"103_CR35","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for Disciplined Convex Programming. Version 2.1. (2014). http:\/\/cvxr.com\/cvx . Accessed 27 May 2019"},{"key":"103_CR36","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-1-84800-155-8_7","volume-title":"Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences","author":"MC Grant","year":"2008","unstructured":"Grant, M.C., Boyd, S.P.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-1-84800-155-8_7"},{"key":"103_CR37","doi-asserted-by":"publisher","first-page":"2400","DOI":"10.1137\/070696313","volume":"31","author":"K Hayami","year":"2010","unstructured":"Hayami, K., Yin, J.F., Ito, T.: GMRES methods for least squares problems. SIAM J. Matrix Anal. Appl. 31, 2400\u20132430 (2010). https:\/\/doi.org\/10.1137\/070696313","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"103_CR38","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409\u2013436 (1952). https:\/\/doi.org\/10.6028\/jres.049.044","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"1","key":"103_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021882330897","volume":"24","author":"JJ J\u00fadice","year":"2003","unstructured":"J\u00fadice, J.J., Patricio, J., Portugal, L.F., Resende, M.G.C., Veiga, G.: A study of preconditioners for network interior point methods. Comput. Optim. Appl. 24(1), 5\u201335 (2003). https:\/\/doi.org\/10.1023\/A:1021882330897","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20133","key":"103_CR40","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01582905","volume":"52","author":"N Karmarkar","year":"1991","unstructured":"Karmarkar, N., Ramakrishnan, K.: Computational results of an interior point algorithm for large scale linear programming. Math. Program. 52(1\u20133), 555\u2013586 (1991). https:\/\/doi.org\/10.1007\/BF01582905","journal-title":"Math. Program."},{"issue":"1\u20133","key":"103_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01587074","volume":"4","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A polynomial-time algorithm for a class of linear complementarity problems. Math. Program. 4(1\u20133), 1\u201326 (1989). https:\/\/doi.org\/10.1007\/BF01587074","journal-title":"Math. Program."},{"issue":"1","key":"103_CR42","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S1052623497329993","volume":"11","author":"J Korzak","year":"2000","unstructured":"Korzak, J.: Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems. SIAM J. Optim. 11(1), 133\u2013148 (2000). https:\/\/doi.org\/10.1137\/S1052623497329993","journal-title":"SIAM J. Optim."},{"issue":"3","key":"103_CR43","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"IJ Lustig","year":"1992","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: On implementing Mehrotra\u2019s predictor-corrector interior-point method for linear programming. SIAM J. Optim. 2(3), 435\u2013449 (1992). https:\/\/doi.org\/10.1137\/0802022","journal-title":"SIAM J. Optim."},{"issue":"1","key":"103_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"IJ Lustig","year":"1994","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: Interior point methods for linear programming: computational state of the art. ORSA J. Comput. 6(1), 1\u201314 (1994). https:\/\/doi.org\/10.1287\/ijoc.6.1.1","journal-title":"ORSA J. Comput."},{"issue":"2","key":"103_CR45","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/ijoc.4.2.103","volume":"4","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: Implementations of affine scaling methods: approximate solutions of systems of linear equations using preconditioned conjugate gradient methods. ORSA J. Comput. 4(2), 103\u2013118 (1992). https:\/\/doi.org\/10.1287\/ijoc.4.2.103","journal-title":"ORSA J. Comput."},{"issue":"4","key":"103_CR46","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992). https:\/\/doi.org\/10.1137\/0802028","journal-title":"SIAM J. Optim."},{"issue":"3","key":"103_CR47","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1137\/S1052623403431494","volume":"15","author":"S Mehrotra","year":"2005","unstructured":"Mehrotra, S., Li, Z.: Convergence conditions and Krylov subspace-based corrections for primalual interior-point method. SIAM J. Optim. 15(3), 635\u2013653 (2005). https:\/\/doi.org\/10.1137\/S1052623403431494","journal-title":"SIAM J. Optim."},{"key":"103_CR48","first-page":"124","volume-title":"Linear and nonlinear conjugate gradient-related methods","author":"S Mehrotra","year":"1996","unstructured":"Mehrotra, S., Wang, J.: Conjugate gradient based implementation of interior point methods for network flow problems. In: Adams, L., Nazareth, J. (eds.) Linear and nonlinear conjugate gradient-related methods, pp. 124\u2013142. SIAM, Philadelphia (1996)"},{"issue":"1\u20133","key":"103_CR49","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"RDC Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms. Part I: linear programming. Math. Program. 44(1\u20133), 27\u201341 (1989). https:\/\/doi.org\/10.1007\/BF01587075","journal-title":"Math. Program."},{"key":"103_CR50","unstructured":"Monteiro, R.D.C., O\u2019Neal, J.W.: Convergence analysis of a long-step primal-dual infeasible interior-point LP algorithm based on iterative linear solvers. Technical report, Georgia Institute of Technology (2003). http:\/\/www.optimization-online.org\/DB_FILE\/2003\/10\/768.pdf"},{"issue":"1","key":"103_CR51","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/S1052623403426398","volume":"15","author":"RDC Monteiro","year":"2004","unstructured":"Monteiro, R.D.C., O\u2019Neal, J.W., Tsuchiya, T.: Uniform boundedness of a preconditioned normal matrix used in interior-point methods. SIAM J. Optim. 15(1), 96\u2013100 (2004). https:\/\/doi.org\/10.1137\/S1052623403426398","journal-title":"SIAM J. Optim."},{"key":"103_CR52","doi-asserted-by":"crossref","unstructured":"Morikuni, K.: Symmetric inner-iteration preconditioning for rank-deficient least squares problems, pp. 1\u201315. arXiv prepr. arXiv:1504.00889 (2015)","DOI":"10.1137\/130946009"},{"issue":"1","key":"103_CR53","doi-asserted-by":"publisher","first-page":"62","DOI":"10.11540\/jsiamt.29.1_62","volume":"29","author":"K Morikuni","year":"2019","unstructured":"Morikuni, K.: Inner-iteration preconditioning with symmetric splitting matrices for symmetric singular linear systems. Trans. JSIAM 29(1), 62\u201377 (2019). https:\/\/doi.org\/10.11540\/jsiamt.29.1_62","journal-title":"Trans. JSIAM"},{"issue":"1","key":"103_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/110828472","volume":"34","author":"K Morikuni","year":"2013","unstructured":"Morikuni, K., Hayami, K.: Inner-iteration Krylov subspace methods for least squares problems. SIAM J. Matrix Anal. Appl. 34(1), 1\u201322 (2013). https:\/\/doi.org\/10.1137\/110828472","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"103_CR55","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/130946009","volume":"36","author":"K Morikuni","year":"2015","unstructured":"Morikuni, K., Hayami, K.: Convergence of inner-iteration GMRES methods for rank-deficient least squares problems. SIAM J. Matrix Anal. Appl. 36(1), 225\u2013250 (2015). https:\/\/doi.org\/10.1137\/130946009","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"103_CR56","unstructured":"Morikuni, K., Hayami, K.: Matlab-MEX Codes of the AB-GMRES Method Preconditioned by NE-SOR Inner Iterations. http:\/\/researchmap.jp\/KeiichiMorikuni\/Implementations\/ . Accessed 27 May 2019"},{"key":"103_CR57","unstructured":"MOSEK ApS: The MOSEK optimization toolbox for MATLAB manual. Version 7.1 (Revision 63). (2015). https:\/\/docs.mosek.com\/7.1\/toolbox.pdf . Accessed 27 May 2019"},{"key":"103_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2004.08.019","volume":"394","author":"ARL Oliveira","year":"2005","unstructured":"Oliveira, A.R.L., Sorensen, D.C.: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming. Linear Algebra Appl. 394, 1\u201324 (2005). https:\/\/doi.org\/10.1016\/j.laa.2004.08.019","journal-title":"Linear Algebra Appl."},{"key":"103_CR59","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/0712047","volume":"12","author":"CC Paige","year":"1975","unstructured":"Paige, C.C., Saunders, M.A.: Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12, 617\u2013629 (1975). https:\/\/doi.org\/10.1137\/0712047","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"103_CR60","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(200003)35:2h91::AID-NET1i3.0.CO;2-T","volume":"35","author":"LF Portugal","year":"2000","unstructured":"Portugal, L.F., Resende, M.G.C., Veiga, G., J\u00fadice, J.J.: A truncated primal-infeasible dual-feasible network interior point method. Networks 35(2), 91\u2013108 (2000). https:\/\/doi.org\/10.1002\/(SICI)1097-0037(200003)35:2h91::AID-NET1i3.0.CO;2-T","journal-title":"Networks"},{"issue":"5","key":"103_CR61","doi-asserted-by":"publisher","first-page":"1992","DOI":"10.1137\/060661673","volume":"29","author":"T Rees","year":"2007","unstructured":"Rees, T., Greif, C.: A preconditioner for linear systems arising from interior point optimization methods. SIAM J. Sci. Comput. 29(5), 1992\u20132007 (2007). https:\/\/doi.org\/10.1137\/060661673","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"103_CR62","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1137\/0803025","volume":"3","author":"MGC Resende","year":"1993","unstructured":"Resende, M.G.C., Veiga, G.: An implementation of the dual affine scaling algorithm for minimum-cost flow on bipartite uncapacitated networks. SIAM J. Optim. 3(3), 516\u2013537 (1993). https:\/\/doi.org\/10.1137\/0803025","journal-title":"SIAM J. Optim."},{"key":"103_CR63","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003). https:\/\/doi.org\/10.1137\/1.9780898718003","edition":"2"},{"key":"103_CR64","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y Saad","year":"1986","unstructured":"Saad, Y., Schultz, M.H.: GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7, 856\u2013869 (1986). https:\/\/doi.org\/10.1137\/0907058","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"103_CR65","unstructured":"Saunders, M.A., Kim, B., Maes, C., Akle, S., Zahr, M.: PDCO: Primal-dual interior method for convex objectives (2013). https:\/\/web.stanford.edu\/group\/SOL\/software\/pdco\/ . Accessed 27 May 2019"},{"key":"103_CR66","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11, 625\u2013633 (1999). https:\/\/doi.org\/10.1080\/10556789908805766","journal-title":"Optim. Methods Softw."},{"key":"103_CR67","doi-asserted-by":"publisher","unstructured":"Tanabe, K.: Centered Newton method for mathematical programming. In: System Modeling and Optimization, Lecture Notes in Control and Information Sciences, Vol. 113, pp. 197\u2013206. Springer, Berlin (1988). https:\/\/doi.org\/10.1007\/BFb0042787","DOI":"10.1007\/BFb0042787"},{"key":"103_CR68","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2014a Matlab software package for semidefinite programming. Optim. Methods Softw. 11, 545\u2013581 (1999). https:\/\/doi.org\/10.1080\/10556789908805762","journal-title":"Optim. Methods Softw."},{"key":"103_CR69","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. Ser. B 95, 189\u2013217 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0347-5","journal-title":"Math. Program. Ser. B"},{"issue":"1\u20134","key":"103_CR70","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1016614603137","volume":"25","author":"W Wang","year":"2000","unstructured":"Wang, W., O\u2019leary, D.P.: Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming. Numer. Algorithms 25(1\u20134), 387\u2013406 (2000). https:\/\/doi.org\/10.1023\/A:1016614603137","journal-title":"Numer. Algorithms"},{"key":"103_CR71","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997). https:\/\/doi.org\/10.1137\/1.9781611971453"},{"issue":"4","key":"103_CR72","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S1052623496304712","volume":"9","author":"SJ Wright","year":"1999","unstructured":"Wright, S.J.: Modified Cholesky factorizations in interior-point algorithms for linear programming. SIAM J. Optim. 9(4), 1159\u20131191 (1999). https:\/\/doi.org\/10.1137\/S1052623496304712","journal-title":"SIAM J. Optim."},{"issue":"1","key":"103_CR73","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementary problem. SIAM J. Optim. 4(1), 208\u2013227 (1994). https:\/\/doi.org\/10.1137\/0804012","journal-title":"SIAM J. Optim."},{"issue":"1","key":"103_CR74","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556789808805699","volume":"10","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: Solving large-scale linear programs by interior-point methods under the Matlab environment. Optim. Methods Softw. 10(1), 1\u201331 (1998). https:\/\/doi.org\/10.1080\/10556789808805699","journal-title":"Optim. Methods Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00103-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00103-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00103-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T07:24:15Z","timestamp":1721373855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00103-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,6]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["103"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00103-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,6,6]]},"assertion":[{"value":"10 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}