Pages that link to "Item:Q5200254"
From MaRDI portal
The following pages link to Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors (Q5200254):
Displayed 47 items.
- The approximate determinantal assignment problem (Q406481) (← links)
- Symmetric tensor decomposition by an iterative eigendecomposition algorithm (Q738956) (← links)
- A framework of constraint preserving update schemes for optimization on Stiefel manifold (Q747775) (← links)
- Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications (Q829560) (← links)
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors (Q831251) (← links)
- The use of the multi-cumulant tensor analysis for the algorithmic optimisation of investment portfolios (Q1620236) (← links)
- Simultaneous component analysis by means of Tucker3 (Q1643427) (← links)
- Joint high-order simulation of spatially correlated variables using high-order spatial statistics (Q1698332) (← links)
- Krylov-type methods for tensor computations.I (Q1931774) (← links)
- Variational calculus with sums of elementary tensors of fixed rank (Q1938431) (← links)
- Greedy low-rank approximation in Tucker format of solutions of tensor linear systems (Q2000621) (← links)
- On polynomial time methods for exact low-rank tensor completion (Q2007852) (← links)
- An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
- Riemannian Newton optimization methods for the symmetric tensor approximation problem (Q2070849) (← links)
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors (Q2084262) (← links)
- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors (Q2085661) (← links)
- Tensor decomposition for learning Gaussian mixtures from moments (Q2133926) (← links)
- Optimization on flag manifolds (Q2149562) (← links)
- Topology of tensor ranks (Q2173721) (← links)
- Transportless conjugate gradient for optimization on Stiefel manifold (Q2185047) (← links)
- Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
- A Riemannian nonmonotone spectral method for self-adjoint tangent vector field (Q2227739) (← links)
- Tensor neural network models for tensor singular value decompositions (Q2307707) (← links)
- Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method (Q2399164) (← links)
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions (Q2631991) (← links)
- On global convergence of alternating least squares for tensor approximation (Q2696915) (← links)
- Nonlinearly Preconditioned Optimization on Grassmann Manifolds for Computing Approximate Tucker Tensor Decompositions (Q2800432) (← links)
- Random Projections for Low Multilinear Rank Tensors (Q2806290) (← links)
- A literature survey of low-rank tensor approximation techniques (Q2864808) (← links)
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization (Q2945125) (← links)
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds (Q2967606) (← links)
- A Riemannian BFGS Method for Nonconvex Optimization Problems (Q3179709) (← links)
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints (Q4603042) (← links)
- A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems (Q4606655) (← links)
- On the convergence of higher-order orthogonal iteration (Q4685516) (← links)
- On best rank-2 and rank-(2,2,2) approximations of order-3 tensors (Q4975109) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques (Q5112237) (← links)
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
- The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence (Q5146632) (← links)
- (Q5159466) (← links)
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold (Q5210519) (← links)
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem (Q5376452) (← links)
- Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms (Q5502141) (← links)
- Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation (Q6038829) (← links)
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
- Minimality of tensors of fixed multilinear rank (Q6105570) (← links)