Tensor Q-rank: new data dependent definition of tensor rank (Q2071330)

From MaRDI portal

Revision as of 23:11, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Tensor Q-rank: new data dependent definition of tensor rank	scientific article

Statements

scholarly article

0 references

Tensor Q-rank: new data dependent definition of tensor rank (English)

0 references

0 references

0 references

0 references

Machine Learning

0 references

publication date

28 January 2022

0 references

full work available at URL

https://arxiv.org/abs/1910.12016

0 references

zbMATH Keywords

tensor rank

0 references

low rank

0 references

tensor completion

0 references

convex optimization

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

A framelet-based image inpainting algorithm

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

The Geometry of Algorithms with Orthogonality Constraints

0 references

Nuclear norm of higher-order tensors

0 references

Tensor rank is NP-complete

0 references

Most Tensor Problems Are NP-Hard

0 references

Matrix factorization for low-rank tensor completion using framelet prior

0 references

Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion

0 references

Tensor-tensor products with invertible linear transforms

0 references

Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging

0 references

Factorization strategies for third-order tensors

0 references

Tensor Decompositions and Applications

0 references

Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning

0 references

A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions

0 references

Robust tensor completion using transformed tensor singular value decomposition

0 references

A feasible method for optimization with orthogonality constraints

0 references

Parallel matrix factorization for low-rank tensor completion

0 references

A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion

0 references

On tensor completion via nuclear norm minimization

0 references

Exact Tensor Completion Using t-SVD

0 references

Tensor Factorization for Low-Rank Tensor Completion

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10994-021-05987-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2071330

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2071330&oldid=38863011"