An iterative algorithm to the least squares problem of \(AX=B\) over linear subspace

DOI10.12286/jssx.j2021-0834MaRDI QIDQ6665187

Hai-Lin Zhou

Publication date: 17 January 2025

Published in: Mathematica Numerica Sinica (Search for Journal in Brave)

zbMATH Keywords

optimal approximationconjugate gradientlinear subspaceleast squares solutionprojection operator

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• On the symmetric solutions of linear matrix equations
• Symmetric solutions of linear matrix equations by matrix decompositions
• Rank/inertia approaches to weighted least-squares solutions of linear matrix equations
• Least-square solutions for inverse problems of centrosymmetric matrices
• Least squares solutions to the rank-constrained matrix approximation problem in the Frobenius norm
• Solvability classes for core problems in matrix total least squares minimization.
• The \((M, N)\)-symmetric Procrustes problem
• The nearness problems for symmetric matrix with a submatrix constraint
• Computing the least-square solutions for centrohermitian matrix problems
• Solution of linear matrix equations in a *-congruence class

This page was built for publication: An iterative algorithm to the least squares problem of \(AX=B\) over linear subspace