Perturbation theory and optimality conditions for the best multilinear rank approximation of a tensor
DOI10.1137/110823298zbMATH Open1242.65076OpenAlexW2025105545MaRDI QIDQ3225545FDOQ3225545
Authors: Lars Eldén, Berkant Savas
Publication date: 21 March 2012
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-72910
Recommendations
- A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- The Best rank-\((R_1,R_2,R_3)\) approximation of tensors by means of a geometric Newton method
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On best rank-\(2\) and rank-\((2,2,2)\) approximations of order-\(3\) tensors
tensorGrassmann manifoldperturbation theoryfirst order optimality conditionssecond order optimality conditionsstationary pointtruncated singular value decompositionqmultilinear rankbest rank-\((pr)\) approximation
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Multilinear algebra, tensor calculus (15A69) Perturbation theory of linear operators (47A55) Exterior algebra, Grassmann algebras (15A75)
Cited In (12)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Preservation of linear constraints in approximation of tensors
- On best rank-2 and rank-(2,2,2) approximations of order-3 tensors
- On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
- Optimality conditions for Tucker low-rank tensor optimization
- Title not available (Why is that?)
- Subtracting a best rank‐1 approximation from p × p × 2(p≥2) tensors
- On the convergence of higher-order orthogonal iteration
- Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor
This page was built for publication: Perturbation theory and optimality conditions for the best multilinear rank approximation of a tensor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225545)