Matrix iterative solutions to the least squares problem of BXA^T = F with some linear constraints
The matrix least squares (LS) problem \(BXA^T= F\) is considered with various linear constraints on the solutions such as symmetry, skew-symmetry, and symmetry/skew-symmetry commuting with a given symmetric matrix. Matrix iterative algorithms are proposed, based on the classical LSQR algorithm [see \textit{C. C. Paige} and \textit{M. A. Saunders}, ACM Trans. Math. Softw. 8, 43--71 (1982; Zbl 0478.65016)] for solving the unconstrained LS problem. Numerical examples are given to display the efficiency of the algorithms.
- Solutions of symmetry-constrained least-squares problems
- An iterative method for the least squares solutions of the linear matrix equations with some constraint
- Least Squares Solution of BXAT=T over Symmetric, Skew-Symmetric, and Positive Semidefinite X
- Least-squares symmetric solution to the matrix equation AXB=C with the norm inequality constraint
- Solving linearly constrained matrix least squares problem by LSQR
- A Constrained Procrustes Problem
- An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\)
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computing a nearest symmetric positive semidefinite matrix
- Computing the Generalized Singular Value Decomposition
- Hermitian, Hermitian \(R\)-symmetric, and Hermitian \(R\)-skew symmetric Procrustes problems
- scientific article; zbMATH DE number 4072254 (Why is no real title available?)
- scientific article; zbMATH DE number 3082033 (Why is no real title available?)
- Large Least Squares Problems Involving Kronecker Products
- Least Squares Solution of BXAT=T over Symmetric, Skew-Symmetric, and Positive Semidefinite X
- Least Squares Solution of Matrix Equation AXB^* + CYD^* = E
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Methods of conjugate gradients for solving linear systems
- On solutions of matrix equation \(AXB+CYD=F\)
- Perturbation analysis of the canonical correlations of matrix pairs
- The symmetric Procrustes problem
- Weighted least squares solutions to general coupled Sylvester matrix equations
- Iterative methods for solving consistent or inconsistent matrix inequality \({AXB} \geqslant C\) with linear constraints
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- An iteration method to solve multiple constrained least squares problems
- Solving linearly constrained matrix least squares problem by LSQR
- An iterative algorithm for solving matrix equations with submatrix constraints
- Solutions of symmetry-constrained least-squares problems
- Iterative solutions to the matrix equation \(AQ=B\) with some orthogonal constraints
- A matrix LSQR algorithm for solving constrained linear operator equations
- A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint
- Algorithm for inequality-constrained least squares problems
- An iterative method for the least squares solutions of the linear matrix equations with some constraint
- Iterative method for the least squares problem of a matrix equation with tridiagonal matrix constraint
- Least squares solution with the minimum-norm to general matrix equations via iteration
- New symmetry preserving method for optimal correction of damping and stiffness matrices using measured modes
- Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems
This page was built for publication: Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870162)
