Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations

DOI10.1137/141002256zbMath1376.15018arXiv1501.01058OpenAlexW1642716668MaRDI QIDQ2797107

Zhening Li, Bo Jiang, Shu-Zhong Zhang

Publication date: 4 April 2016

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

tensor eigenvaluetensor eigenvectorsymmetric complex tensorBanach's theoremconjugate complex polynomial

Mathematics Subject Classification ID

Fixed-point theorems (47H10) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Multilinear algebra, tensor calculus (15A69)

Related Items

Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors, The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor, Further results on tensor nuclear norms, Symmetric Hermitian decomposability criterion, decomposition, and its applications, Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms, Hermitian Tensor Decompositions, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, On decompositions and approximations of conjugate partial-symmetric tensors, Approximation algorithms for optimization of real-valued general conjugate complex forms, Rank-\(r\) decomposition of symmetric tensors, Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement

Uses Software

• Complex Optimization Toolbox

Cites Work

• Unnamed Item
• Approximation algorithms for discrete polynomial optimization
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Approximation methods for complex polynomial optimization
• Eigenvalues and invariants of tensors
• On approximating complex quadratic optimization problems via semidefinite programming relaxations
• The degree of the E-characteristic polynomial of an even order tensor
• On the convergence of the coordinate descent method for convex differentiable minimization
• On Waring's problem for several algebraic forms
• The number of eigenvalues of a tensor
• Tensor principal component analysis via convex optimization
• Eigenvalues of a real supersymmetric tensor
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
• Geometric Measure of Entanglement and U-Eigenvalues of Tensors
• Maximum Block Improvement and Polynomial Optimization
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• On New Classes of Nonnegative Symmetric Tensors
• Shifted Power Method for Computing Tensor Eigenpairs
• On the complexity of purely complex μ computation and related problems in multidimensional systems
• A Multilinear Singular Value Decomposition
• Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
• Unconstrained Optimization of Real Functions in Complex Variables
• The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
• Alternating direction method of multipliers for real and complex polynomial optimization models
• The geometric measure of multipartite entanglement and the singular values of a hypermatrix
• Symmetric Tensors and Symmetric Tensor Rank
• Approximation Methods for Polynomial Optimization
• Complex Quadratic Optimization and Semidefinite Programming
• Über homogene Polynome in ($L^{2}$)