An efficient iterative method for solving a class of constrained tensor least squares problem
From MaRDI portal
Publication:6131494
DOI10.1016/j.apnum.2023.10.008OpenAlexW4388070382MaRDI QIDQ6131494
Yong-Shen Zhang, Qing-Wen Wang, Xue-Feng Duan
Publication date: 5 April 2024
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2023.10.008
convergence analysisimage restorationalternating direction multiplier methodconstrained tensor least squares problem
Cites Work
- Tensor Decompositions and Applications
- The reflexive least squares solutions of the general coupled matrix equations with a submatrix constraint
- The reflexive least squares solutions of the matrix equation \(A_1X_1B_1+A_2X_2B_2+\cdots +A_lX_lB_l=C\) with a submatrix constraint
- Convex constrained optimization for large-scale generalized Sylvester equations
- On the convergence properties of the projected gradient method for convex optimization
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
- Extending BiCG and BiCR methods to solve the Stein tensor equation
- Numerical algorithms for solving discrete Lyapunov tensor equation
- The general solution to a system of coupled Sylvester-type quaternion tensor equations involving \(\eta\)-Hermicity
- Numerical multilinear algebra and its applications
- An iteration method to solve multiple constrained least squares problems
- An eigenvalue problem for even order tensors with its applications
- Moore–Penrose inverse of tensors via Einstein product
- Solving Multilinear Systems via Tensor Inversion
- Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- An iterative algorithm to solve the generalized Sylvester tensor equations
- An optimal preconditioner for tensor equations involving Einstein product
- Krylov subspace methods to solve a class of tensor equations via the Einstein product
- Iterative algorithms for solving some tensor equations
- Bidiagonalization of Matrices and Solution of Linear Equations
- Numerical subspace algorithms for solving the tensor equations involving Einstein product
- An efficient method for solving a matrix least squares problem over a matrix inequality constraint
This page was built for publication: An efficient iterative method for solving a class of constrained tensor least squares problem
