Semidefinite Relaxations for Best Rank-1 Tensor Approximations
From MaRDI portal
Publication:2936592
DOI10.1137/130935112zbMath1305.65134arXiv1308.6562OpenAlexW1986370957MaRDI QIDQ2936592
Publication date: 17 December 2014
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.6562
tensornumerical experimentsum of squaressemidefinite programrank-1 approximationNewton-conjugate gradient augmented Lagrangian method
Related Items
Convergence rate analysis for the higher order power method in best rank one approximations of tensors ⋮ Robust Eigenvectors of Symmetric Tensors ⋮ A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems ⋮ Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications ⋮ An adaptive gradient method for computing generalized tensor eigenpairs ⋮ Spherical optimization with complex variables for computing US-eigenpairs ⋮ Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ On the local stability of semidefinite relaxations ⋮ Multilinear PageRank ⋮ Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ Highly entangled tensors ⋮ A note on semidefinite programming relaxations for polynomial optimization over a single sphere ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ On approximation algorithm for orthogonal low-rank tensor approximation ⋮ Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors ⋮ Computing extreme eigenvalues of large scale Hankel tensors ⋮ On norm compression inequalities for partitioned block tensors ⋮ Unnamed Item ⋮ Greedy Approaches to Symmetric Orthogonal Tensor Decomposition ⋮ Effective Criteria for Specific Identifiability of Tensors and Forms ⋮ Algorithms for structure preserving best rank-one approximations of partially symmetric tensors ⋮ A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors ⋮ A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors ⋮ A nonmonotone accelerated Levenberg–Marquardt method for the ‐eigenvalues of symmetric tensors ⋮ Low Rank Symmetric Tensor Approximations ⋮ A DCA-Newton method for quartic minimization over the sphere ⋮ Completely positive tensors in the complex field ⋮ Feasible Newton methods for symmetric tensor Z-eigenvalue problems ⋮ Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual ⋮ Spectral norm of a symmetric tensor and its computation ⋮ The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors ⋮ Symmetric Tensor Nuclear Norms ⋮ Hankel Tensor Decompositions and Ranks ⋮ On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming ⋮ Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method ⋮ Globally maximizing the sum of squares of quadratic forms over the unit sphere ⋮ Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems ⋮ SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints ⋮ On decompositions and approximations of conjugate partial-symmetric tensors ⋮ Iterative algorithms for computing US- and U-eigenpairs of complex tensors ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ Real eigenvalues of nonsymmetric tensors ⋮ On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems ⋮ A hybrid second-order method for homogenous polynomial optimization over unit sphere ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ Lower bounds for cubic optimization over the sphere ⋮ Computing Tensor Eigenvalues via Homotopy Methods ⋮ Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations ⋮ How entangled can a multi-party system possibly be? ⋮ Computing Tensor $Z$-Eigenvectors with Dynamical Systems ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ Computing tensor Z-eigenvalues via shifted inverse power method ⋮ Symmetric rank-1 approximation of symmetric high-order tensors ⋮ Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor ⋮ A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors ⋮ SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) ⋮ \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex ⋮ Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement ⋮ A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors ⋮ Low-Rank Approximation and Completion of Positive Tensors ⋮ Homotopy techniques for tensor decomposition and perfect identifiability ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem ⋮ Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors ⋮ A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors ⋮ Numerical optimization for symmetric tensor decomposition ⋮ A generalization of inverse power method for computing eigenpairs of symmetric tensors ⋮ Three Hypergraph Eigenvector Centralities ⋮ Computing the largest C-eigenvalue of a tensor using convex relaxation
