{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:29:05Z","timestamp":1735583345999},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,6]],"date-time":"2014-11-06T00:00:00Z","timestamp":1415232000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s11075-014-9933-x","type":"journal-article","created":{"date-parts":[[2014,11,5]],"date-time":"2014-11-05T03:27:52Z","timestamp":1415158072000},"page":"9-41","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Limited-memory LDL\u22a4 factorization of symmetric quasi-definite matrices with application to constrained optimization"],"prefix":"10.1007","volume":"70","author":[{"given":"Dominique","family":"Orban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,6]]},"reference":[{"issue":"4","key":"9933_CR1","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P Amestoy","year":"1996","unstructured":"Amestoy, P., Davis, T., Duff, I.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886\u2013905 (1996). doi: 10.1137\/S0895479894278952","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9933_CR2","volume-title":"Optimal Filtering","author":"BDO Anderson","year":"1979","unstructured":"Anderson, B.D.O., Moore, J.B.: Optimal Filtering. Prentice-Hall, Englewood Cliffs (1979)"},{"key":"9933_CR3","doi-asserted-by":"crossref","unstructured":"Aravkin, A.Y., Burke, J.V., Pillonetto, G.: Optimization viewpoint on kalman smoothing with applications to robust and sparse estimation. In: Compressed Sensing & Sparse Filtering, pp. 237\u2013280. Springer (2014)","DOI":"10.1007\/978-3-642-38398-4_8"},{"key":"9933_CR4","unstructured":"Arioli, M., Orban, D.: Iterative methods for symmetric quasi-definite linear systems\u2014Part I: Theory. Cahier du GERAD G-2013-32, GERAD, Montr\u00e9al, QC, Canada (2013)"},{"key":"9933_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624100","volume-title":"Iterative Solution Methods","author":"O Axelsson","year":"1994","unstructured":"Axelsson, O.: Iterative Solution Methods. Cambridge University Press, Cambridge (1994)"},{"issue":"137","key":"9933_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1090\/S0025-5718-1977-0428694-0","volume":"31","author":"JR Bunch","year":"1977","unstructured":"Bunch, J.R., Kaufman, L.: Some stable methods for calculating inertia and solving symmetric linear systems. Math. Comput. 31(137), 163\u2013179 (1977)","journal-title":"Math. Comput."},{"key":"9933_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(90)90302-S","volume":"129","author":"JJ Buoni","year":"1990","unstructured":"Buoni, J.J.: A stable method for the incomplete factorization of H-matrices. Linear Algebra Appl. 129, 143\u2013154 (1990). doi: 10.1016\/0024-3795(90)90302-S","journal-title":"Linear Algebra Appl."},{"key":"9933_CR8","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: An integrated package for nonlinear optimization. In G. di Pillo and M. Roma, editors, Large-Scale Nonlinear Optimization, volume 83 of Nonconvex Optimization and Its Applications, pp. 35\u201359. Springer Verlag (2006)","DOI":"10.1007\/0-387-30065-1_4"},{"issue":"1","key":"9933_CR9","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BF01933580","volume":"20","author":"WM Chan","year":"1980","unstructured":"Chan, W.M., George, A.: A linear time implementation of the reverse Cuthill-McKee algorithm. BIT Numer. Math. 20(1), 8\u201314 (1980). doi: 10.1007\/BF01933580","journal-title":"BIT Numer. Math."},{"key":"9933_CR10","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1002\/qj.49712354414","volume":"123","author":"P Courtier","year":"1997","unstructured":"Courtier, P.: Dual formulation of four-dimensional variational assimilation. Q. J. R. Meteorol. Soc. 123, 2449\u20132461 (1997). doi: 10.1002\/qj.49712354414","journal-title":"Q. J. R. Meteorol. Soc."},{"key":"9933_CR11","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 1969 24th national conference, ACM \u201969, pp. 157\u2013172 (1969). doi: 10.1145\/800195.805928","DOI":"10.1145\/800195.805928"},{"key":"9933_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. Ser. B 91, 201\u2013213 (2002). doi: 10.1007\/s101070100263","journal-title":"Math. Program. Ser. B"},{"issue":"1","key":"9933_CR13","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/05063427X","volume":"28","author":"HS Dollar","year":"2006","unstructured":"Dollar, H.S., Gould, N.I.M., Schilders, W.H.A., Wathen, A.J.: Implicit-factorization preconditioning and iterative solvers for regularized saddle-point systems. SIAM J. Matrix Anal. Appl. 28(1), 170\u2013189 (2006). doi: 10.1137\/05063427X","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9933_CR14","volume-title":"Finite Elements and Fast Iterative Solvers with Applications in Incompressible Fluid Dynamics. Numerical Mathematics and Scientific Computation","author":"H Elman","year":"2005","unstructured":"Elman, H., Silvester, D., Wathen, A.: Finite Elements and Fast Iterative Solvers with Applications in Incompressible Fluid Dynamics. Numerical Mathematics and Scientific Computation. Oxford University Press, Oxford (2005)"},{"issue":"4","key":"9933_CR15","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A Forsgren","year":"2002","unstructured":"Forsgren, A., Gill, Ph. E., Wright, M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44(4), 525\u2013597 (2002). doi: 10.1137\/S0036144502414942","journal-title":"SIAM Rev."},{"issue":"1","key":"9933_CR16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s12532-012-0035-2","volume":"4","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Orban, D.: A primal-dual regularized interior-point method for convex quadratic programs. Math. Program. Comput. 4(1), 71\u2013107 (2012). doi: 10.1007\/s12532-012-0035-2","journal-title":"Math. Program. Comput."},{"key":"9933_CR17","unstructured":"Friedlander, M.P., van Den Berg, E.: Spot\u2014a linear-operator toolbox (2013). www.cs.ubc.ca\/labs\/scl\/spot"},{"issue":"1","key":"9933_CR18","first-page":"35","volume":"17","author":"PE Gill","year":"1996","unstructured":"Gill, P.E., Saunders, M.A., Shinnerl, J.R.: On the stability of Cholesky factorization for symmetric quasidefinite systems. SIAM J. Optim. 17(1), 35\u201346 (1996). doi: 10.1137\/S0895479893252623","journal-title":"SIAM J. Optim."},{"key":"9933_CR19","volume-title":"Matrix Computations. Johns Hopkins Series in the Mathematical Sciences","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F., 3rd: Matrix Computations. Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins, Baltimore (1996)","edition":"3rd"},{"issue":"4","key":"9933_CR20","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph. L.: CUTEr and SifDec, a Constrained and Unconstrained Testing Environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"9933_CR21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0962492904000248","volume":"14","author":"NIM Gould","year":"2005","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph. L.: Numerical methods for large-scale nonlinear optimization. Acta Numerica 14, 299\u2013361 (2005). doi: 10.1017\/S0962492904000248","journal-title":"Acta Numerica"},{"key":"9933_CR22","unstructured":"Greif, C., He, S., Liu, P.: sym-ildl: Incomplete L D L T factorizations of indefinite symmetric matrices (2013). URL www.cs.ubc.ca\/inutard\/html"},{"issue":"1","key":"9933_CR23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/120890600","volume":"24","author":"C Greif","year":"2014","unstructured":"Greif, C., Moulding, E., Orban, D.: Bounds on the eigenvalues of block matrices arising from interior-point methods. SIAM J. Optim. 24(1), 49\u201383 (2014). doi: 10.1137\/120890600","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9933_CR24","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01931691","volume":"18","author":"I Gustafsson","year":"1978","unstructured":"Gustafsson, I.: A class of first order factorization methods. BIT 18(2), 142\u2013156 (1978). doi: 10.1007\/BF01931691","journal-title":"BIT"},{"key":"9933_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms. Number OT80 in Other Titles in Applied Mathematics","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J., 2nd: Accuracy and Stability of Numerical Algorithms. Number OT80 in Other Titles in Applied Mathematics. SIAM, Philadelphia (2002)","edition":"2nd"},{"key":"9933_CR26","unstructured":"HSL: A collection of Fortran codes for large-scale scientific computation. www.hsl.rl.ac.uk (2013)"},{"issue":"1","key":"9933_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/200979.200981","volume":"21","author":"MT Jones","year":"1995","unstructured":"Jones, M.T., Plassmann, P.E.: An improved incomplete Cholesky factorization. ACM Trans. Math. Softw. 21(1), 5\u201317 (1995). doi: 10.1145\/200979.200981","journal-title":"ACM Trans. Math. Softw."},{"issue":"6","key":"9933_CR28","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1002\/(SICI)1099-1506(199811\/12)5:6<483::AID-NLA156>3.0.CO;2-7","volume":"5","author":"IE Kaporin","year":"1998","unstructured":"Kaporin, I.E.: High quality preconditioning of a general symmetric positive definite matrix based on its U TU + U T R + R T U $U^{T U + U^{T} R + R^{T} U}$ decomposition. Numer. Linear Algebra Appl. 5(6), 483\u2013509 (1998). doi: 10.1002\/(SICI)1099-1506(199811\/12)5:6<483::AID-NLA156>3.0.CO;2-7","journal-title":"Numer. Linear Algebra Appl."},{"issue":"2","key":"9933_CR29","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1137\/S1064827502405094","volume":"25","author":"N Li","year":"2003","unstructured":"Li, N., Saad, Y., Chow, E.: Crout versions of ILU for general sparse matrices. SIAM J. Sci. Comput. 25(2), 716\u2013728 (2003). doi: 10.1137\/S1064827502405094","journal-title":"SIAM J. Sci. Comput."},{"key":"9933_CR30","first-page":"75","volume":"20","author":"N Li","year":"2005","unstructured":"Li, N., Saad, Y.: Crout versions of ILU factorization with pivoting for sparse symmetric matrices. Electron. Trans. Numer. Anal. 20, 75\u201385 (2005)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"1","key":"9933_CR31","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/S1064827597327334","volume":"21","author":"C-J Lin","year":"1999","unstructured":"Lin, C.-J., Mor\u00e9, J.J.: Incomplete Cholesky factorizations with limited memory. SIAM J. Sci. Comput. 21(1), 24\u201345 (1999). doi: 10.1137\/S1064827597327334","journal-title":"SIAM J. Sci. Comput."},{"key":"9933_CR32","volume-title":"Shifted incomplete Cholesky factorization. In: Duff, I. S., Stewart, G. W. (eds.) Sparse Matrix Proceedings, pp. 41\u201361","author":"TA Manteuffel","year":"1979","unstructured":"Manteuffel, T.A.: Shifted incomplete Cholesky factorization. In: Duff, I. S., Stewart, G. W. (eds.) Sparse Matrix Proceedings, pp. 41\u201361. SIAM, Philadelphia (1979)"},{"issue":"150","key":"9933_CR33","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1090\/S0025-5718-1980-0559197-0","volume":"34","author":"TA Manteuffel","year":"1980","unstructured":"Manteuffel, T.A.: An incomplete factorization technique for positive definite linear systems. Math. Comput. 34(150), 473\u2013497 (1980)","journal-title":"Math. Comput."},{"key":"9933_CR34","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11 &amp; 12","author":"I Maros","year":"1999","unstructured":"Maros, I., M\u00e9sz\u00e1ros, C.: A repository of convex quadratic programming problems. Optim. Methods Softw. 11 & 12, 671\u2013681 (1999). Special Issue on Interior Point Methods.","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"9933_CR35","doi-asserted-by":"crossref","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). doi: 10.1137\/0802028","journal-title":"SIAM J. Optim."},{"key":"9933_CR36","first-page":"148","volume":"137","author":"JA Meijerink","year":"1977","unstructured":"Meijerink, J.A., van der Vorst, H.A.: An iterative solution method for linear equations systems of which the coefficient matrix is a symmetric M-matrix. Math. Comput. 137, 148\u2013162 (1977)","journal-title":"Math. Comput."},{"issue":"3","key":"9933_CR37","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s002110050095","volume":"69","author":"A Messaoudi","year":"1995","unstructured":"Messaoudi, A.: On the stability of the incomplete LU-factorizations and characterizations of H-matrices. Numer. Math. 69(3), 321\u2013331 (1995). doi: 10.1007\/s002110050095","journal-title":"Numer. Math."},{"issue":"2","key":"9933_CR38","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/355887.355893","volume":"6","author":"N Munksgaard","year":"1980","unstructured":"Munksgaard, N.: Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients. ACM Trans. Math. Softw. 6(2), 206\u2013219 (1980). doi: 10.1145\/355887.355893","journal-title":"ACM Trans. Math. Softw."},{"key":"9933_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2112-3","volume-title":"Introduction to Parallel and Vector Solution of Linear Systems","author":"JM Ortega","year":"1988","unstructured":"Ortega, J.M.: Introduction to Parallel and Vector Solution of Linear Systems. Fontiers of Computer Science. Springer Science+Business Media, New York (1988). Originally published by Plenum Press"},{"issue":"4","key":"9933_CR40","doi-asserted-by":"crossref","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(4), 617\u2013629 (1975). doi: 10.1137\/0712047","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"9933_CR41","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1002\/nla.1680010405","volume":"1","author":"Y Saad","year":"1994","unstructured":"Saad, Y.: ILUT: A dual threshdol incomplete LU factorization. Numer Linear Algebra Appl 1(4), 387\u2013402 (1994). doi: 10.1002\/nla.1680010405","journal-title":"Numer Linear Algebra Appl"},{"key":"9933_CR42","unstructured":"Saunders, M.A.: PDCO\u2014primal-dual interior methods. Class notes #7 for Large-Scale Numerical Optimization, MS&amp;E 318\/CME 338, Stanford University, Spring 2013. http:\/\/web.stanford.edu\/group\/SOL\/software\/pdco"},{"key":"9933_CR43","volume-title":"HSL_MI28: an efficient and robust limited-memory incomplete Cholesky factorization code. Preprint RAL-P-2013-004","author":"J Scott","year":"2013","unstructured":"Scott, J., T\u016fma, M.: HSL_MI28: an efficient and robust limited-memory incomplete Cholesky factorization code. Preprint RAL-P-2013-004. Rutherford Appleton Laboratory, Didcot (2013)"},{"key":"9933_CR44","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0024-3795(91)90383-8","volume":"154\u2013156","author":"M Tismenetsky","year":"1991","unstructured":"Tismenetsky, M.: A new preconditioning technique for solving large sparse linear systems. Linear Algebra Appl. 154\u2013156, 331\u2013353 (1991). doi: 10.1016\/0024-3795(91)90383-8","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"9933_CR45","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1137\/S0895479897321088","volume":"23","author":"M T\u016fma","year":"2002","unstructured":"T\u016fma, M.: A note on the L D L T decomposition of matrices from saddle-point problems. SIAM J. Matrix Anal. Appl. 23(4), 903\u2013915 (2002). doi: 10.1137\/S0895479897321088","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"9933_CR46","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"RJ Vanderbei","year":"1995","unstructured":"Vanderbei, R.J.: Symmetric quasi-definite matrices. SIAM J. Optim. 5(1), 100\u2013113 (1995). doi: 10.1137\/0805005","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"9933_CR47","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei, R.J., Shanno, D.F.: An interior point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13(1\u20133), 231\u2013252 (1999). doi: 10.1023\/A:1008677427361","journal-title":"Comput. Optim. Appl."},{"key":"9933_CR48","doi-asserted-by":"crossref","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. (2006). doi: 10.1007\/s10107-004-0559-y","DOI":"10.1007\/s10107-004-0559-y"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9933-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9933-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9933-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T01:53:36Z","timestamp":1566006816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9933-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,6]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["9933"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9933-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,6]]}}}