Low‐rank approximation of tensors via sparse optimization

DOI10.1002/nla.2136zbMath1499.65247arXiv1504.05273OpenAlexW2963431840WikidataQ114235423 ScholiaQ114235423MaRDI QIDQ4637405

Carmeliza Navasca, Xiao-Fei Wang

Publication date: 18 April 2018

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.05273

zbMATH Keywords

sparsitylow-rank approximationproximal alternating minimization\(l_1\)-regularization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Multilinear algebra, tensor calculus (15A69)

Related Items (8)

A sparse rank-1 approximation algorithm for high-order tensors ⋮ The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations ⋮ A proximal point like method for solving tensor least-squares problems ⋮ Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors ⋮ The Relation Between a Tensor and Its Associated Semi-Symmetric Form ⋮ Low-CP-rank tensor completion via practical regularization

This page was built for publication: Low‐rank approximation of tensors via sparse optimization