Robust Low-Rank Tensor Decomposition with the L <sub>2</sub> Criterion (Q6631163)

From MaRDI portal

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Robust Low-Rank Tensor Decomposition with the L ₂ Criterion

scientific article; zbMATH DE number 7937295

Language	Label	Description	Also known as
English	Robust Low-Rank Tensor Decomposition with the L <sub>2</sub> Criterion	scientific article; zbMATH DE number 7937295

Statements

scholarly article

0 references

Robust Low-Rank Tensor Decomposition with the L <sub>2</sub> Criterion (English)

0 references

0 references

0 references

0 references

0 references

publication date

31 October 2024

0 references

MaRDI profile type

0 references

0 references

Efficient MATLAB Computations with Sparse and Factored Tensors

0 references

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

0 references

A Limited Memory Algorithm for Bound Constrained Optimization

0 references

Uncertainty Quantification for Nonconvex Tensor Completion: Confidence Intervals, Heteroscedasticity and Optimality

0 references

Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization

0 references

Robust principal component analysis?

0 references

Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition

0 references

A User-Friendly Computational Framework for Robust Structured Regression with the L<sub>2</sub> Criterion

0 references

A Multilinear Singular Value Decomposition

0 references

On the Best Rank-1 and Rank-(<i>R</i><sub>1</sub> ,<i>R</i><sub>2</sub> ,. . .,<i>R<sub>N</sub></i>) Approximation of Higher-Order Tensors

0 references

Tucker factorization with missing data with application to low-\(n\)-rank tensor completion

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

An optimal statistical and computational framework for generalized tensor estimation

0 references

Generalized Canonical Polyadic Tensor Decomposition

0 references

An approach to n-mode components analysis

0 references

Factorization strategies for third-order tensors

0 references

Tensor Decompositions and Applications

0 references

Principal component analysis of three-mode data by means of alternating least squares algorithms

0 references

On the limited memory BFGS method for large scale optimization

0 references

Minimum distance Lasso for robust high-dimensional regression

0 references

Robust <formula formulatype="inline"><tex Notation="TeX">$L_{2}E$</tex> </formula> Estimation of Transformation for Non-Rigid Registration

0 references

Tensor-Train Decomposition

0 references

On polynomial time methods for exact low-rank tensor completion

0 references

Statistically optimal and computationally efficient low rank tensor completion from noisy entries

0 references

Robust fitting of a Weibull model with optional censoring

0 references

Cross: efficient low-rank tensor completion

0 references

Tensor SVD: Statistical and Computational Limits

0 references

Algorithm 778: L-BFGS-B

0 references

Identifiers

10.1080/00401706.2023.2200541

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6631163

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