On the tensor spectral \(p\)-norm and its dual norm via partitions
From MaRDI portal
Publication:2307701
DOI10.1007/s10589-020-00177-zzbMath1441.15014OpenAlexW3005040051MaRDI QIDQ2307701
Publication date: 25 March 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00177-z
Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Multilinear algebra, tensor calculus (15A69)
Related Items (3)
On norm compression inequalities for partitioned block tensors ⋮ Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual ⋮ Optimality conditions for Tucker low-rank tensor optimization
Cites Work
- On the nuclear norm and the singular value decomposition of tensors
- On tensor completion via nuclear norm minimization
- Approximation algorithms for discrete polynomial optimization
- Operator norm inequalities between tensor unfoldings on the partition lattice
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- On norm compression inequalities for partitioned block tensors
- Relations of the nuclear norm of a tensor and its matrix flattenings
- Combinatorial methods for the spectral \(p\)-norm of hypermatrices
- Eigenvalues of a real supersymmetric tensor
- Exact matrix completion via convex optimization
- Bounds on the Spectral Norm and the Nuclear Norm of a Tensor Based on Tensor Partitions
- Block Tensor Unfoldings
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Matrix Analysis
- Nuclear norm of higher-order tensors
- Probability Bounds for Polynomial Functions in Random Variables
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking
- Blind Multilinear Identification
- Symmetric Tensor Nuclear Norms
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- Approximation Methods for Polynomial Optimization
- Most Tensor Problems Are NP-Hard
- Approximating the Cut-Norm via Grothendieck's Inequality
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Unnamed Item
This page was built for publication: On the tensor spectral \(p\)-norm and its dual norm via partitions
