{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T17:28:04Z","timestamp":1776101284340,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:00:00Z","timestamp":1722384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:00:00Z","timestamp":1722384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12361082"],"award-info":[{"award-number":["12361082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s11075-024-01905-w","type":"journal-article","created":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T07:14:16Z","timestamp":1722410056000},"page":"1043-1061","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Variable parameter Uzawa method for solving the indefinite least squares problem"],"prefix":"10.1007","volume":"99","author":[{"given":"Lingsheng","family":"Meng","sequence":"first","affiliation":[]},{"given":"Kailiang","family":"Xin","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,31]]},"reference":[{"key":"1905_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.laa.2020.09.006","volume":"623","author":"AW Bojanczyk","year":"2021","unstructured":"Bojanczyk, A.W.: Algorithms for indefinite linear least squares problems. Linear Algebra Appl. 623, 104\u2013127 (2021)","journal-title":"Linear Algebra Appl."},{"key":"1905_CR2","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1137\/S0895479802401497","volume":"24","author":"A Bojanczyk","year":"2003","unstructured":"Bojanczyk, A., Higham, N.J., Patel, H.: Solving the indefinite least squares problem by hyperbolic QR factorization. SIAM J. Matrix Anal. Appl. 24, 914\u2013931 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1905_CR3","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/BF01405194","volume":"56","author":"RE Bank","year":"1990","unstructured":"Bank, R.E., Welfert, B.D., Yserentant, H.: A class of iterative methods for solving saddle point problems. Numer. Math. 56, 645\u2013666 (1990)","journal-title":"Numer. Math."},{"key":"1905_CR4","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1137\/S0895479896302229","volume":"20","author":"S Chandrasekaran","year":"1998","unstructured":"Chandrasekaran, S., Gu, M., Sayed, A.H.: A stable and efficient algorithm for the indefinite linear least-squares problem. SIAM J. Matrix Anal. Appl. 20, 354\u2013362 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1905_CR5","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1080\/00207160.2018.1467007","volume":"96","author":"HA Diao","year":"2019","unstructured":"Diao, H.A., Zhou, T.Y.: Backward error and condition number analysis for the indefinite linear least squares problem. Int. J. Comput. Math. 96, 1603\u20131622 (2019)","journal-title":"Int. J. Comput. Math."},{"key":"1905_CR6","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1137\/0717073","volume":"17","author":"GH Golub","year":"1980","unstructured":"Golub, G.H., Van Loan, C.F.: An analysis of the total least squares problem. SIAM J. Numer. Anal. 17, 883\u2013893 (1980)","journal-title":"SIAM J. Numer. Anal."},{"key":"1905_CR7","doi-asserted-by":"crossref","unstructured":"Hassibi, B., Sayed, A.H., Kailath, T.: Recursive linear estimation in Krein spaces. I. Theory. In: Proceedings of 32nd IEEE Conference on Decision and Control, pp. 3489\u20133494. IEEE (1993)","DOI":"10.1109\/CDC.1993.325867"},{"key":"1905_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"1905_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/S0895479899364064","volume":"23","author":"QY Hu","year":"2001","unstructured":"Hu, Q.Y., Zou, J.: An iterative method with variable relaxation parameters for saddle-point problems. SIAM J. Matrix Anal. Appl. 23, 317\u2013338 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1905_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s002110100386","volume":"93","author":"QY Hu","year":"2002","unstructured":"Hu, Q.Y., Zou, J.: Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems. Numer. Math. 93, 333\u2013359 (2002)","journal-title":"Numer. Math."},{"key":"1905_CR11","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1137\/S1052623403428683","volume":"16","author":"QY Hu","year":"2006","unstructured":"Hu, Q.Y., Zou, J.: Nonlinear inexact Uzawa algorithms for linear and nonlinear saddle-point problems. SIAM J. Optim. 16, 798\u2013825 (2006)","journal-title":"SIAM J. Optim."},{"key":"1905_CR12","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.apnum.2017.09.006","volume":"123","author":"HY Li","year":"2018","unstructured":"Li, H.Y., Wang, S.X.: On the partial condition numbers for the indefinite least squares problem. Appl. Numer. Math. 123, 200\u2013220 (2018)","journal-title":"Appl. Numer. Math."},{"key":"1905_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10092-011-0039-8","volume":"48","author":"QH Liu","year":"2011","unstructured":"Liu, Q.H., Li, X.J.: Preconditioned conjugate gradient methods for the solution of indefinite least squares problems. Calcolo 48, 261\u2013271 (2011)","journal-title":"Calcolo"},{"key":"1905_CR14","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.cam.2013.02.016","volume":"250","author":"QH Liu","year":"2013","unstructured":"Liu, Q.H., Zhang, F.D.: Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems. J. Comput. Appl. Math. 250, 210\u2013216 (2013)","journal-title":"J. Comput. Appl. Math."},{"key":"1905_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10092-013-0090-8","volume":"51","author":"QH Liu","year":"2014","unstructured":"Liu, Q.H., Liu, A.J.: Block SOR methods for the solution of indefinite least squares problems. Calcolo 51, 367\u2013379 (2014)","journal-title":"Calcolo"},{"key":"1905_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/97.484217","volume":"3","author":"AH Sayed","year":"1996","unstructured":"Sayed, A.H., Hassibi, B., Kailath, T.: Inertia properties of indefinite quadratic forms. IEEE Signal Process. Lett. 3, 57\u201359 (1996)","journal-title":"IEEE Signal Process. Lett."},{"key":"1905_CR17","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1080\/00207160.2019.1658869","volume":"97","author":"J Song","year":"2020","unstructured":"Song, J.: USSOR method for solving the indefinite least squares problem. Int. J. Comput. Math. 97, 1781\u20131791 (2020)","journal-title":"Int. J. Comput. Math."},{"key":"1905_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971002","volume-title":"The Total Least Squares Problem: Computational Aspects and Analysis","author":"S Van Huffel","year":"1991","unstructured":"Van Huffel, S., Vandewalle, J.: The Total Least Squares Problem: Computational Aspects and Analysis. SIAM, Philadelphia (1991)"},{"key":"1905_CR19","volume-title":"Matrix Iterative Analysis","author":"RS Varga","year":"1962","unstructured":"Varga, R.S.: Matrix Iterative Analysis. Prentice-Hall, Englewood (1962)"},{"key":"1905_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11741-004-0049-8","volume":"8","author":"HG Xu","year":"2004","unstructured":"Xu, H.G.: A backward stable hyperbolic QR factorization method for solving indefinite least squares problem. J. Shanghai Univ. 8, 391\u2013396 (2004)","journal-title":"J. Shanghai Univ."},{"key":"1905_CR21","volume":"446","author":"YJ Zhang","year":"2023","unstructured":"Zhang, Y.J., Li, H.Y.: Splitting-based randomized iterative methods for solving indefinite least squares problem. Appl. Math. Comput. 446, 127892 (2023)","journal-title":"Appl. Math. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01905-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01905-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01905-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T03:51:16Z","timestamp":1746849076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01905-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,31]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1905"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01905-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3904491\/v1","asserted-by":"object"}]},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,31]]},"assertion":[{"value":"28 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}