The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor

DOI10.1007/s40305-022-00425-5arXiv2111.03238OpenAlexW3212918572WikidataQ114219383 ScholiaQ114219383MaRDI QIDQ6151002

Qingzhi Yang, Pengfei Huang, Amina Sabir

Publication date: 9 February 2024

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.03238

zbMATH Keywords

approximation algorithmconvex relaxationconjugate partial-symmetric tensorrank-one equivalence property

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Best approximation, Chebyshev systems (41A50) Hermitian, skew-Hermitian, and related matrices (15B57) Multilinear algebra, tensor calculus (15A69)

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Fixed point and Bregman iterative methods for matrix rank minimization
• A sparse rank-1 approximation algorithm for high-order tensors
• Tensor principal component analysis via convex optimization
• Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
• The Quadratic Eigenvalue Problem
• Rank-One Approximation to High Order Tensors
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
• Maximum Block Improvement and Polynomial Optimization
• A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
• A Singular Value Thresholding Algorithm for Matrix Completion
• Shifted Power Method for Computing Tensor Eigenpairs
• On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
• Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
• Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
• Low‐rank approximation of tensors via sparse optimization
• The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
• Hermitian Tensor Decompositions
• Convexification of Power Flow Equations in the Presence of Noisy Measurements
• A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Most Tensor Problems Are NP-Hard