An efficient iterative method for solving a class of constrained tensor least squares problem

DOI10.1016/J.APNUM.2023.10.008MaRDI QIDQ6131494zbMATH OpenOpenAlexFDO

Authors Xuefeng Duan, Yong-Shen Zhang, Qing-Wen Wang

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

zbMATH Keywords

convergence analysisimage restorationalternating direction multiplier methodconstrained tensor least squares problem

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Mathematical programming (90Cxx)

Recommendations

• An efficient algorithm for solving the nonnegative tensor least squares problem
• The LSQR method for solving tensor least-squares problems
• Paige's algorithm for solving a class of tensor least squares problem
• Linearized alternating direction method for constrained linear least-squares problem.

Cites work

• An efficient method for solving a matrix least squares problem over a matrix inequality constraint
• An eigenvalue problem for even order tensors with its applications
• An iteration method to solve multiple constrained least squares problems
• An iterative algorithm to solve the generalized Sylvester tensor equations
• An optimal preconditioner for tensor equations involving Einstein product
• Bidiagonalization of Matrices and Solution of Linear Equations
• Convex constrained optimization for large-scale generalized Sylvester equations
• Extending BiCG and BiCR methods to solve the Stein tensor equation
• Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
• Iterative algorithms for solving some tensor equations
• Krylov subspace methods to solve a class of tensor equations via the Einstein product
• Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint
• Moore–Penrose inverse of tensors via Einstein product
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Numerical algorithms for solving discrete Lyapunov tensor equation
• Numerical multilinear algebra and its applications
• Numerical subspace algorithms for solving the tensor equations involving Einstein product
• On the convergence properties of the projected gradient method for convex optimization
• Solving multilinear systems via tensor inversion
• Tensor Decompositions and Applications
• The general solution to a system of coupled Sylvester-type quaternion tensor equations involving \(\eta\)-Hermicity
• 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₁X₁B₁+A₂X₂B₂+ +A_lX_lB_l=C with a submatrix constraint

Cited in

(1)

• Paige's algorithm for solving a class of tensor least squares problem

This page was built for publication: An efficient iterative method for solving a class of constrained tensor least squares problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131494)