Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization

SIAM Journal on Optimization - United States
doi 10.1137/120868323
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Extrapolated Alternating Algorithms for Approximate Canonical Polyadic Decomposition

2020English

A Coupled Joint Eigenvalue Decomposition Algorithm for Canonical Polyadic Decomposition of Tensors

2016English

Decomposition of Low Rank Multi-Symmetric Tensor

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Hole-Filling by Rank Sparsity Tensor Decomposition for Medical Imaging

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2011English

Decomposition Optimization Algorithms for Distributed Radar Systems

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2016English

Almost Sure $L_r$-Norm Convergence for Data-Based Histogram Density Estimates

Theory of Probability and its Applications
UncertaintyStatisticsProbability
1991English

Shift-Invariant Canonical Polyadic Decomposition of Complex-Valued Multi-Subject fMRI Data With a Phase Sparsity Constraint

IEEE Transactions on Medical Imaging
Electronic EngineeringUltrasound TechnologyRadiologicalComputer Science ApplicationsElectricalSoftware
2020English

Automotive Rank Based ELM Using Iterative Decomposition

International Journal of Intelligent Engineering and Systems
EngineeringComputer Science
2019English

A Tensor Decomposition for Geometric Grouping and Segmentation

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy