On norm compression inequalities for partitioned block tensors
From MaRDI portal
(Redirected from Publication:2174201)
Approximation methods and heuristics in mathematical programming (90C59) Multilinear algebra, tensor calculus (15A69) Miscellaneous inequalities involving matrices (15A45) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Recommendations
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- Operator norm inequalities between tensor unfoldings on the partition lattice
- A concise proof to the spectral and nuclear norm bounds through tensor partitions
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
Cites work
- scientific article; zbMATH DE number 6474941 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
- A norm compression inequality for block partitioned positive semidefinite matrices
- Adaptive covariance matrix estimation through block thresholding
- Approximation Methods for Polynomial Optimization
- Approximation algorithms for discrete polynomial optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Blind Multilinear Identification
- Block tensor unfoldings
- Block tensors and symmetric embeddings
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- Chebyshev polynomials and best rank-one approximation ratio
- Combinatorial methods for the spectral \(p\)-norm of hypermatrices
- Computing the gradient in optimization algorithms for the CP decomposition in constant memory through tensor blocking
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Embedding constants of trilinear Schatten-von Neumann classes
- Equivalence constants for matrix norms: A problem of Goldberg
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Inequalities for trace norms of \(2\times 2\) block matrices.
- Maximum block improvement and polynomial optimization
- Most tensor problems are NP-hard
- New trace norm inequalities for \(2\times 2\) blocks of diagonal matrices
- Norm inequalities for partitioned operators and an application
- Nuclear norm of higher-order tensors
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- On a norm compression inequality for \(2\times N\) partitioned block matrices
- On the nuclear norm and the singular value decomposition of tensors
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- Operator norm inequalities between tensor unfoldings on the partition lattice
- Probability bounds for polynomial functions in random variables
- Quantum information theory
- Relations of the nuclear norm of a tensor and its matrix flattenings
- Semidefinite relaxations for best rank-1 tensor approximations
- Tensor Decompositions and Applications
- Tensor principal component analysis via convex optimization
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- The best rank-one approximation ratio of a tensor space
Cited in
(8)- On the tensor spectral \(\mathbf{p}\)-norm and its higher order power method
- Extreme Ratio Between Spectral and Frobenius Norms of Nonnegative Tensors
- Maximum relative distance between real rank-two and rank-one tensors
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- Probabilistic bounds on best rank-1 approximation ratio
- Chebyshev polynomials and best rank-one approximation ratio
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- Operator norm inequalities between tensor unfoldings on the partition lattice
This page was built for publication: On norm compression inequalities for partitioned block tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174201)
