An approximation method of CP rank for third-order tensor completion (Q2662903)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	An approximation method of CP rank for third-order tensor completion	scientific article

Statements

scholarly article

0 references

An approximation method of CP rank for third-order tensor completion (English)

0 references

0 references

Tai-Xiang Jiang

0 references

Michael Kwok-Po Ng

0 references

Numerische Mathematik

0 references

publication date

15 April 2021

0 references

zbMATH Keywords

third-order tensor completion

0 references

NP-hardness

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00211-021-01185-9

0 references

Fundamental Conditions for Low-CP-Rank Tensor Completion

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem

0 references

The Condition Number of Join Decompositions

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

A Multilinear Singular Value Decomposition

0 references

Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

0 references

The Geometry of Algorithms with Orthogonality Constraints

0 references

Nuclear norm of higher-order tensors

0 references

Tensor completion and low-n-rank tensor recovery via convex optimization

0 references

Robust Low-Rank Tensor Recovery: Models and Algorithms

0 references

Tensor rank is NP-complete

0 references

Most Tensor Problems Are NP-Hard

0 references

The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format

0 references

Tensor principal component analysis via convex optimization

0 references

Tensor and its tucker core: The invariance relationships

0 references

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

0 references

Tensor Decompositions and Applications

0 references

Low-rank tensor completion by Riemannian optimization

0 references

Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics

0 references

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train Format

0 references

Riemannian Optimization for High-Dimensional Tensor Completion

0 references

Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation

0 references

Condition numbers for the tensor rank decomposition

0 references

A feasible method for optimization with orthogonality constraints

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

Coordinate descent algorithms

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

Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization

0 references

Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems

0 references

Smooth PARAFAC Decomposition for Tensor Completion

0 references

On tensor completion via nuclear norm minimization

0 references

Exact Tensor Completion Using t-SVD

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00211-021-01185-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2662903

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