Pages that link to "Item:Q2848170"

The following pages link to Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization (Q2848170):

Displaying 50 items.

• Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm (Q344915) (← links)
• Computing the polyadic decomposition of nonnegative third order tensors (Q634027) (← links)
• The polyadic structure of factorable function tensors with applications to high-order minimization techniques (Q1069447) (← links)
• Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method (Q1669000) (← links)
• Optimization via separated representations and the canonical tensor decomposition (Q1694619) (← links)
• Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions (Q1741131) (← links)
• Computing dense tensor decompositions with optimal dimension trees (Q1741867) (← links)
• Tensor decompositions with banded matrix factors (Q1931776) (← links)
• Structuring data with block term decomposition: decomposition of joint tensors and variational block term decomposition as a parametrized mixture distribution model (Q2038495) (← links)
• Complex and quaternionic optimization (Q2061302) (← links)
• Riemannian Newton optimization methods for the symmetric tensor approximation problem (Q2070849) (← links)
• Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors (Q2087499) (← links)
• Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems (Q2112682) (← links)
• Tensor decomposition for learning Gaussian mixtures from moments (Q2133926) (← links)
• MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale (Q2140454) (← links)
• A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis (Q2146528) (← links)
• An ATLD-ALS method for the trilinear decomposition of large third-order tensors (Q2156526) (← links)
• High-order tensor estimation via trains of coupled third-order CP and Tucker decompositions (Q2174454) (← links)
• Greedy low-rank algorithm for spatial connectome regression (Q2184210) (← links)
• Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery (Q2212078) (← links)
• Spherical optimization with complex variables for computing US-eigenpairs (Q2374370) (← links)
• Condition numbers for the tensor rank decomposition (Q2408941) (← links)
• Symmetric Hermitian decomposability criterion, decomposition, and its applications (Q2689746) (← links)
• On global convergence of alternating least squares for tensor approximation (Q2696915) (← links)
• A randomized singular value decomposition for third-order oriented tensors (Q2697009) (← links)
• Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations (Q2797107) (← links)
• A nonlinear GMRES optimization algorithm for canonical tensor decomposition (Q2909269) (← links)
• Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition (Q2923363) (← links)
• Nonlinearly preconditioned L-BFGS as an acceleration mechanism for alternating least squares with application to tensor decomposition (Q3120348) (← links)
• The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor (Q3176269) (← links)
• New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors (Q3195440) (← links)
• Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms (Q3225546) (← links)
• Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL (Q3456872) (← links)
• Low Rank Symmetric Tensor Approximations (Q4598341) (← links)
• Exploiting Efficient Representations in Large-Scale Tensor Decompositions (Q4631411) (← links)
• From Computation to Comparison of Tensor Decompositions (Q4986824) (← links)
• Incremental CP Tensor Decomposition by Alternating Minimization Method (Q4997836) (← links)
• Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition (Q4997839) (← links)
• Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition (Q4997840) (← links)
• Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition (Q5009907) (← links)
• SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains (Q5065504) (← links)
• $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials (Q5088657) (← links)
• SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction (Q5112544) (← links)
• Face Representations via Tensorfaces of Various Complexities (Q5131175) (← links)
• Hermitian Tensor Decompositions (Q5146612) (← links)
• (Q5155916) (← links)
• On identifiability of higher order block term tensor decompositions of rank <i>L</i>_<i>r</i>⊗ rank-1 (Q5210715) (← links)
• Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable (Q5232115) (← links)
• The Dynamics of Swamps in the Canonical Tensor Approximation Problem (Q5238232) (← links)
• Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking (Q5258607) (← links)