The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors
From MaRDI portal
Publication:2693786
DOI10.1007/S11590-022-01892-8OpenAlexW4280507731WikidataQ114222149 ScholiaQ114222149MaRDI QIDQ2693786FDOQ2693786
Authors: Manman Dong, Qingni Zhu, Chun-Yan Wang, Haibin Chen 
Publication date: 24 March 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01892-8
Recommendations
- Fourth-order partially symmetric tensors: theory and algorithm
- Symmetric rank-1 approximation of symmetric high-order tensors
- On the best rank-1 approximation to higher-order symmetric tensors
- On the rank and the approximation of symmetric tensors
- On the M-eigenvalue estimation of fourth-order partially symmetric tensors
- Algorithms for structure preserving best rank-one approximations of partially symmetric tensors
- Best rank-one approximation of fourth-order partially symmetric tensors by neural network
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
proximal alternating linearized minimizationpartially symmetric tensorpartially symmetric rank-1 approximation
Cites Work
- Title not available (Why is that?)
- Two-Point Step Size Gradient Methods
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the best rank-1 approximation of higher-order supersymmetric tensors
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- On the strong ellipticity of the anisotropic linearly elastic materials
- Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- Conditions for strong ellipticity and M-eigenvalues
- Sufficient conditions for strong ellipticity for a class of anisotropic materials
- On the ellipticity of the equations of nonlinear elastostatics for a special material
- Tensor eigenvalues and their applications
- Symmetric rank-1 approximation of symmetric high-order tensors
- Facial recognition using tensor-tensor decompositions
- A new truncation strategy for the higher-order singular value decomposition
- Elasticity \(\mathcal{M} \)-tensors and the strong ellipticity condition
- Best rank-one approximation of fourth-order partially symmetric tensors by neural network
- Blind Signal Separation via Tensor Decomposition With Vandermonde Factor: Canonical Polyadic Decomposition
Cited In (7)
- Algorithms for structure preserving best rank-one approximations of partially symmetric tensors
- The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor
- Best rank-one approximation of fourth-order partially symmetric tensors by neural network
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm
- Symmetric rank-1 approximation of symmetric high-order tensors
This page was built for publication: The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693786)
