{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T09:11:54Z","timestamp":1787389914333,"version":"3.56.0"},"reference-count":28,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[1996,10]]},"abstract":"<jats:p>The solution of the unconstrained weighted linear least-squares problem is known to be a convex combination of the basic solutions formed by the nonsingular subsystems if the weight matrix is diagonal and positive definite. In particular, this implies that the norm of this solution is uniformly bounded for any diagonal and positive definite weight matrix. In addition, the solution set is known to be the relative interior of a finite set of polytopes if the weight matrix varies over the set of positive definite diagonal matrices. In this paper, these results are reviewed and generalized to the set of weight matrices that are symmetric, positive semidefinite, and diagonally dominant and that give unique solution to the least-squares problem. This is done by means of a particular symmetric diagonal decomposition of the weight matrix, giving a finite number of diagonally weighted problems but in a space of higher dimension. Extensions to equality-constrained weighted linear least-squares problems are given. A discussion of why the boundedness properties do not hold for general symmetric positive definite weight matrices is given. The motivation for this research is from interior methods for optimization.<\/jats:p>","DOI":"10.1137\/s0895479895284014","type":"journal-article","created":{"date-parts":[[2005,2,27]],"date-time":"2005-02-27T07:15:07Z","timestamp":1109488507000},"page":"763-788","source":"Crossref","is-referenced-by-count":19,"title":["On Linear Least-Squares Problems with Diagonally Dominant Weight Matrices"],"prefix":"10.1137","volume":"17","author":[{"given":"Anders","family":"Forsgren","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.21236\/AD0709564"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90340-G"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(90)90395-S"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(86)90307-1"},{"key":"R5","series-title":"Pitman Res. Notes Math. Ser.","first-page":"1","volume-title":"Numerical analysis 1991 (Dundee, 1991)","volume":"260","author":"Bj\u00f6rck \u00c5.","year":"1992"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01935013"},{"key":"R7","first-page":"674","volume":"8","author":"Dikin I. I.","year":"1967","journal-title":"Soviet Math. Dokl."},{"key":"R8","first-page":"54","volume":"12","author":"Dikin I. I.","year":"1974","journal-title":"Upravlyaemye Sistemy"},{"key":"R9","unstructured":"I. S. Duff, N. I. M. Gould, J. K. Reid, J. A. Scott, K. Turner,  The Factorization of Sparse Symmetric Indefinite Matrices, Tech. Report, CSS 236, Computer Science and Systems Division, AERE Harwell, Oxford, England,  1989"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894270658"},{"key":"R11","volume-title":"Numerical linear algebra and optimization. Vol. 1","author":"Gill Philip E.","year":"1991"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479893252623"},{"key":"R13","volume-title":"Matrix computations","author":"Golub Gene H.","year":"1989"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/1034048"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585660"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0613079"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90223-B"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"R19","volume-title":"Solving least squares problems","author":"Lawson Charles L.","year":"1974"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(90)90056-I"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(89)90594-6"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.6.1006"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/114\/1097868"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892230948"},{"key":"R25","unstructured":"M. Wei,  On the boundedness of weighted pseudoinverses and oblique projections, Tech. Report, Department of Mathematics, East China Normal University, Shanghai, China,  1993"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002300"},{"key":"R27","unstructured":"S. J. Wright,  Stability of linear algebra computations in interior-point methods for linear programming,  1994, Preprint MCS-P446-0694, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479893260498"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0895479895284014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:35:30Z","timestamp":1787319330000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0895479895284014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["10.1137\/S0895479895284014"],"URL":"https:\/\/doi.org\/10.1137\/s0895479895284014","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}