Pages that link to "Item:Q5300549"

The following pages link to Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC (Q5300549):

Displaying 12 items.

• Numerical CP decomposition of some difficult tensors (Q508007) (← links)
• A seminorm regularized alternating least squares algorithm for canonical tensor decomposition (Q1631439) (← 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)
• Tensor decomposition for learning Gaussian mixtures from moments (Q2133926) (← links)
• Condition numbers for the tensor rank decomposition (Q2408941) (← links)
• On global convergence of alternating least squares for tensor approximation (Q2696915) (← links)
• A literature survey of low-rank tensor approximation techniques (Q2864808) (← links)
• The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor (Q3176269) (← links)
• Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems (Q3465242) (← links)
• Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition (Q6087747) (← links)
• A block-randomized stochastic method with importance sampling for CP tensor decomposition (Q6126539) (← links)