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

DOI10.1007/S40305-022-00425-5arXiv2111.03238OpenAlexW3212918572WikidataQ114219383 ScholiaQ114219383MaRDI QIDQ6151002FDOQ6151002

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)

Abstract: We present an orthogonal matrix outer product decomposition for the fourth-order conjugate partial-symmetric (CPS) tensor and show that the greedy successive rank-one approximation (SROA) algorithm can recover this decomposition exactly. Based on this matrix decomposition, the CP rank of CPS tensor can be bounded by the matrix rank, which can be applied to low rank tensor completion. Additionally, we give the rank-one equivalence property for the CPS tensor based on the SVD of matrix, which can be applied on the rank-one approximation for CPS tensors.

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

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

Cites Work

• A Singular Value Thresholding Algorithm for Matrix Completion
• Title not available (Why is that?)
• Tensor Decompositions and Applications
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Maximum block improvement and polynomial optimization
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Tensor principal component analysis via convex optimization
• Most Tensor Problems Are NP-Hard
• Fixed point and Bregman iterative methods for matrix rank minimization
• On the best rank-1 approximation of higher-order supersymmetric tensors
• A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
• Shifted Power Method for Computing Tensor Eigenpairs
• The quadratic eigenvalue problem
• A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
• The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
• Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
• Rank-one approximation to high order tensors
• On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
• A sparse rank-1 approximation algorithm for high-order tensors
• Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
• Low‐rank approximation of tensors via sparse optimization
• Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
• Convexification of Power Flow Equations in the Presence of Noisy Measurements
• Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems
• Hermitian Tensor Decompositions
• Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors

This page was built for publication: The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151002)