{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:25:32Z","timestamp":1761582332777,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100015089","name":"Office of Academic Research, U.S. Naval Academy","doi-asserted-by":"publisher","award":["Junior NARC"],"award-info":[{"award-number":["Junior NARC"]}],"id":[{"id":"10.13039\/100015089","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000105","name":"Office of Advanced Cyberinfrastructure","doi-asserted-by":"publisher","award":["1835499"],"award-info":[{"award-number":["1835499"]}],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s11590-024-02095-z","type":"journal-article","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T11:11:27Z","timestamp":1708600287000},"page":"681-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact QR factorizations of rectangular matrices"],"prefix":"10.1007","volume":"18","author":[{"given":"Christopher","family":"Lourenco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6258-5428","authenticated-orcid":false,"given":"Erick","family":"Moreno-Centeno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"issue":"4","key":"2095_CR1","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/BF01436528","volume":"7","author":"FL Bauer","year":"1965","unstructured":"Bauer, F.L.: Elimination with weighted row combinations for solving linear equations and least squares problems. Numer. Math. 7(4), 338\u2013352 (1965). https:\/\/doi.org\/10.1007\/BF01436528","journal-title":"Numer. Math."},{"issue":"2","key":"2095_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02166032","volume":"9","author":"GH Golub","year":"1966","unstructured":"Golub, G.H., Wilkinson, J.H.: Note on the iterative refinement of least squares solution. Numer. Math. 9(2), 139\u2013148 (1966)","journal-title":"Numer. Math."},{"issue":"C","key":"2095_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0024-3795(87)90103-0","volume":"88","author":"TF Chan","year":"1987","unstructured":"Chan, T.F.: Rank revealing QR factorizations. Linear Algebra Appl. 88(C), 67\u201382 (1987). https:\/\/doi.org\/10.1016\/0024-3795(87)90103-0","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"2095_CR4","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1137\/0913043","volume":"13","author":"TF Chan","year":"1992","unstructured":"Chan, T.F., Hansen, P.C.: Some applications of the rank revealing QR factorization. Stat. Comput. 13(3), 727\u2013741 (1992)","journal-title":"Stat. Comput."},{"issue":"1\u20133","key":"2095_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0024-3795(99)00230-X","volume":"309","author":"NJ Higham","year":"2000","unstructured":"Higham, N.J.: QR factorization with complete pivoting and accurate computation of the SVD. Linear Algebra Appl. 309(1\u20133), 153\u2013174 (2000)","journal-title":"Linear Algebra Appl."},{"key":"2095_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. Siam, Philadelphia, PA, USA (2002)","edition":"2"},{"issue":"1","key":"2095_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1137\/18M1218212","volume":"42","author":"T Fukaya","year":"2020","unstructured":"Fukaya, T., Kannan, R., Nakatsukasa, Y., Yamamoto, Y., Yanagisawa, Y.: Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices. SIAM J. Sci. Comput. 42(1), 477\u2013503 (2020). https:\/\/doi.org\/10.1137\/18M1218212. arXiv:1809.11085","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2095_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1093\/comjnl\/4.3.265","volume":"4","author":"JGF Francis","year":"1961","unstructured":"Francis, J.G.F.: The QR transformation a unitary analogue to the LR transformation-part 1. Comput. J. 4(3), 265\u2013271 (1961). https:\/\/doi.org\/10.1093\/comjnl\/4.3.265","journal-title":"Comput. J."},{"issue":"3","key":"2095_CR9","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/0041-5553(63)90168-X","volume":"1","author":"VN Kublanovskaya","year":"1962","unstructured":"Kublanovskaya, V.N.: On some algorithms for the solution of the complete eigenvalue problem. USSR Comput. Math. Math. Phys. 1(3), 637\u2013657 (1962). https:\/\/doi.org\/10.1016\/0041-5553(63)90168-X","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"2","key":"2095_CR10","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1137\/0710035","volume":"10","author":"BN Parlett","year":"1973","unstructured":"Parlett, B.N., Poole, W.G., Jr.: A geometric theory for the QR, LU and power iterations. SIAM J. Numer. Anal. 10(2), 389\u2013412 (1973)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"2095_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01588976","volume":"14","author":"PE Gill","year":"1978","unstructured":"Gill, P.E., Murray, W.: Numerically stable methods for quadratic programming. Math. Program. 14(1), 349\u2013372 (1978). https:\/\/doi.org\/10.1007\/BF01588976","journal-title":"Math. Program."},{"issue":"3","key":"2095_CR12","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0895479898338147","volume":"21","author":"M Arioli","year":"2000","unstructured":"Arioli, M.: The use of QR factorization in sparse quadratic programming and backward error issues. SIAM J. Matrix Anal. Appl. 21(3), 825\u2013839 (2000). https:\/\/doi.org\/10.1137\/S0895479898338147","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2095_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s12532-019-00154-6","volume":"11","author":"T Weber","year":"2019","unstructured":"Weber, T., Sager, S., Gleixner, A.: Solving quadratic programs to high precision using scaled iterative refinement. Math. Program. Comput. 11(3), 421\u2013455 (2019)","journal-title":"Math. Program. Comput."},{"key":"2095_CR14","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, B., Sch\u00f6nherr, S.: An efficient, exact, and generic quadratic programming solver for geometric optimization. In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry, pp. 110\u2013118 (2000)","DOI":"10.1145\/336154.336191"},{"key":"2095_CR15","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, vol. 3, 4th edn. Johns Hopkins University Press, Baltimore (2013)"},{"issue":"2","key":"2095_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1377612.1377616","volume":"35","author":"Z Drma\u010d","year":"2008","unstructured":"Drma\u010d, Z., Bujanovi\u0107, Z.: On the failure of rank-revealing QR factorization software: a case study. ACM Trans. Math. Softw. (TOMS) 35(2), 1\u201328 (2008). https:\/\/doi.org\/10.1145\/1377612.1377616","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"2095_CR17","doi-asserted-by":"publisher","unstructured":"Zhang, S., Baharlouei, E., Wu, P.: High accuracy matrix computations on neural engines: A study of QR factorization and its applications. In: Proceedings of the 29th International Symposium on High-Performance Parallel and Distributed Computing, pp. 17\u201328. Association for Computing Machinery, Inc, New York, USA (2020). https:\/\/doi.org\/10.1145\/3369583.3392685","DOI":"10.1145\/3369583.3392685"},{"issue":"4","key":"2095_CR18","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/ijoc.2015.0653","volume":"27","author":"AR Escobedo","year":"2015","unstructured":"Escobedo, A.R., Moreno-Centeno, E.: Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations. INFORMS J. Comput. 27(4), 677\u2013689 (2015). https:\/\/doi.org\/10.1287\/ijoc.2015.0653","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2095_CR19","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1137\/20M1371592","volume":"43","author":"CJ Lourenco","year":"2022","unstructured":"Lourenco, C.J., Moreno-Centeno, E.: Exactly solving sparse rational linear systems via roundoff-error-free Cholesky Factorizations. SIAM J. Matrix Anal. Appl. 43(1), 439\u2013463 (2022). https:\/\/doi.org\/10.1137\/20M1371592","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2095_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11704-008-0005-z","volume":"2","author":"W Zhou","year":"2008","unstructured":"Zhou, W., Jeffrey, D.J.: Fraction-free matrix factors: new forms for LU and QR factors. Front. Comput. Sci. China 2(1), 67\u201380 (2008). https:\/\/doi.org\/10.1007\/s11704-008-0005-z","journal-title":"Front. Comput. Sci. China"},{"key":"2095_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"TA Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia, PA, USA (2006)"},{"issue":"94","key":"2095_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1090\/S0025-5718-1966-0192673-4","volume":"20","author":"JR Rice","year":"1966","unstructured":"Rice, J.R.: Experiments on Gram\u2013Schmidt orthogonalization. Math. Comput. 20(94), 325\u2013328 (1966)","journal-title":"Math. Comput."},{"issue":"1","key":"2095_CR23","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/0106004","volume":"6","author":"W Givens","year":"1958","unstructured":"Givens, W.: Computation of plain unitary rotations transforming a general matrix to triangular form. J. Soc. Ind. Appl. Math. 6(1), 26\u201350 (1958)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"4","key":"2095_CR24","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/320941.320947","volume":"5","author":"AS Householder","year":"1958","unstructured":"Householder, A.S.: Unitary triangularization of a nonsymmetric matrix. J. ACM (JACM) 5(4), 339\u2013342 (1958)","journal-title":"J. ACM (JACM)"},{"issue":"6","key":"2095_CR25","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1080\/00029890.1991.11995755","volume":"98","author":"L Pursell","year":"1991","unstructured":"Pursell, L., Trimble, S.Y.: Gram\u2013Schmidt orthogonalization by Gauss elimination. Am. Math. Mon. 98(6), 544\u2013549 (1991). https:\/\/doi.org\/10.1080\/00029890.1991.11995755","journal-title":"Am. Math. Mon."},{"issue":"4","key":"2095_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Stand. Sect. B 71(4), 241\u2013245 (1967)","journal-title":"J. Res. Nat. Bur. Stand. Sect. B"},{"issue":"103","key":"2095_CR27","first-page":"565","volume":"22","author":"EH Bareiss","year":"1968","unstructured":"Bareiss, E.H.: Sylvester\u2019s identity and multistep integer-preserving Gaussian elimination. Math. Comput. 22(103), 565\u2013578 (1968)","journal-title":"Math. Comput."},{"key":"2095_CR28","first-page":"1","volume":"2","author":"RM Montante-Pardo","year":"1977","unstructured":"Montante-Pardo, R.M., M\u00e9ndez-Cavazos, M.A.: Un m\u00e9todo n\u00famerico para c\u00e1lculo matricial. Rev. T\u00e9cnico-Cient\u00edfica de Divulgaci\u00f3n 2, 1\u201324 (1977)","journal-title":"Rev. T\u00e9cnico-Cient\u00edfica de Divulgaci\u00f3n"},{"issue":"2","key":"2095_CR29","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1137\/18M1202499","volume":"40","author":"C Lourenco","year":"2019","unstructured":"Lourenco, C., Escobedo, A.R., Moreno-Centeno, E., Davis, T.A.: Exact solution of sparse linear systems via left-looking roundoff-error-free LU factorization in time proportional to arithmetic work. SIAM J. Matrix Anal. Appl. 40(2), 609\u2013638 (2019). https:\/\/doi.org\/10.1137\/18M1202499","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2095_CR30","first-page":"240","volume":"17","author":"J Hadamard","year":"1893","unstructured":"Hadamard, J.: R\u00e9solution d\u2019une question relative aux d\u00e9terminants. Bull. Sci. Math. 17(1), 240\u2013246 (1893)","journal-title":"Bull. Sci. Math."},{"key":"2095_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York (2012)"},{"key":"2095_CR32","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1017\/S0962492916000076","volume":"25","author":"TA Davis","year":"2016","unstructured":"Davis, T.A., Rajamanickam, S., Sid-Lakhdar, W.M.: A survey of direct methods for sparse linear systems. Acta Numer. 25, 383\u2013566 (2016). https:\/\/doi.org\/10.1017\/S0962492916000076","journal-title":"Acta Numer."},{"issue":"1","key":"2095_CR33","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/1132973.1132981","volume":"32","author":"L Foster","year":"2006","unstructured":"Foster, L., Kommu, R.: Algorithm 853: an efficient algorithm for solving rank-deficient least squares problems. ACM Trans. Math. Softw. (TOMS) 32(1), 157\u2013165 (2006)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"2095_CR34","unstructured":"Foster, L.V., Davis, T.: Reliable calculation of numerical rank, null space bases, basic solutions and pseudoinverse solutions using SuiteSparseQR. In: Householder Symposium XVIII on Numerical Linear Algebra, p. 79 (2011)"},{"key":"2095_CR35","doi-asserted-by":"crossref","unstructured":"Golub, G., Pereyra, V.: Differentiation of pseudoinverses, separable nonlinear least squares and other tales. In: Generalized Inverses and Applications, pp. 303\u2013324. Academic Press, New York (1976)","DOI":"10.1016\/B978-0-12-514250-2.50012-3"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02095-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02095-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02095-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T11:42:48Z","timestamp":1711107768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02095-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,22]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2095"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02095-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,2,22]]},"assertion":[{"value":"8 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}