The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems

DOI10.1137/110835335zbMath1269.15026OpenAlexW2088221456MaRDI QIDQ4902922

Xinzhen Zhang, Liqun Qi, Chen Ling

Publication date: 18 January 2013

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

Full work available at URL: http://hdl.handle.net/10397/5954

zbMATH Keywords

numerical resultssymmetric tensorpower algorithmspherical optimizationbest rank-1 approximationbest symmetric rank-1 approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (49)

Nonsingular \(H\)-tensor and its criteria ⋮ Convergence rate analysis for the higher order power method in best rank one approximations of tensors ⋮ A note on Banach's results concerning homogeneous polynomials associated with nonnegative tensors ⋮ Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications ⋮ On the spherical quasi-convexity of quadratic functions on spherically subdual convex sets ⋮ Concepts and techniques of optimization on the sphere ⋮ On the spherical quasi-convexity of quadratic functions ⋮ Spherical optimization with complex variables for computing US-eigenpairs ⋮ Newton Correction Methods for Computing Real Eigenpairs of Symmetric Tensors ⋮ SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor ⋮ Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ A globally convergent method for solving a quartic generalized Markowitz portfolio problem ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ A note on semidefinite programming relaxations for polynomial optimization over a single sphere ⋮ On norm compression inequalities for partitioned block tensors ⋮ A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors ⋮ On the spherical convexity of quadratic functions ⋮ Greedy Approaches to Symmetric Orthogonal Tensor Decomposition ⋮ Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple ⋮ Low Rank Symmetric Tensor Approximations ⋮ The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor ⋮ Extreme Ratio Between Spectral and Frobenius Norms of Nonnegative Tensors ⋮ Z-eigenvalue localization sets for tensors and the applications in rank-one approximation and quantum entanglement ⋮ On New Classes of Nonnegative Symmetric Tensors ⋮ Lower bounds for finding stationary points I ⋮ Symmetric Tensor Nuclear Norms ⋮ Lower bounds for finding stationary points II: first-order methods ⋮ Properties and methods for finding the best rank-one approximation to higher-order tensors ⋮ Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method ⋮ The number of singular vector tuples and uniqueness of best rank-one approximation of tensors ⋮ On the rank and the approximation of symmetric tensors ⋮ On approximate diagonalization of third order symmetric tensors by orthogonal transformations ⋮ The Expected Number of Eigenvalues of a Real Gaussian Tensor ⋮ Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique ⋮ Approximation algorithms for nonnegative polynomial optimization problems over unit spheres ⋮ Solution structures of tensor complementarity problem ⋮ Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations ⋮ Exact line and plane search for tensor optimization ⋮ Symmetric rank-1 approximation of symmetric high-order tensors ⋮ Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints ⋮ Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives ⋮ Unfoldings and the rank-one approximation of the tensor ⋮ Test of copositive tensors ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem ⋮ Optimization of mean-field spin glasses ⋮ \(Z\)-eigenvalues based structured tensors: \(\mathcal{M}_Z\)-tensors and strong \(\mathcal{M}_Z\)-tensors ⋮ A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors ⋮ A generalization of inverse power method for computing eigenpairs of symmetric tensors

This page was built for publication: The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems