On norm compression inequalities for partitioned block tensors
DOI10.1007/S10092-020-0356-XzbMATH Open1436.15027OpenAlexW3006445651WikidataQ114228541 ScholiaQ114228541MaRDI QIDQ2174201FDOQ2174201
Publication date: 21 April 2020
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-020-0356-x
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)
Cites Work
- Title not available (Why is that?)
- Tensor Decompositions and Applications
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Maximum block improvement and polynomial optimization
- Nuclear norm of higher-order tensors
- Tensor principal component analysis via convex optimization
- Most Tensor Problems Are NP-Hard
- Adaptive covariance matrix estimation through block thresholding
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Norm inequalities for partitioned operators and an application
- Inequalities for trace norms of \(2\times 2\) block matrices.
- New trace norm inequalities for \(2\times 2\) blocks of diagonal matrices
- A norm compression inequality for block partitioned positive semidefinite matrices
- The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
- On the nuclear norm and the singular value decomposition of tensors
- The Best Rank-One Approximation Ratio of a Tensor Space
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Blind Multilinear Identification
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- Block tensors and symmetric embeddings
- Quantum information theory
- Probability Bounds for Polynomial Functions in Random Variables
- Approximation algorithms for discrete polynomial optimization
- Approximation Methods for Polynomial Optimization
- Relations of the nuclear norm of a tensor and its matrix flattenings
- Block tensor unfoldings
- Operator norm inequalities between tensor unfoldings on the partition lattice
- On a norm compression inequality for \(2\times N\) partitioned block matrices
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Title not available (Why is that?)
- Equivalence constants for matrix norms: A problem of Goldberg
- Combinatorial methods for the spectral \(p\)-norm of hypermatrices
- A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- Chebyshev Polynomials and Best Rank-one Approximation Ratio
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking
- Title not available (Why is that?)
Cited In (6)
- On the tensor spectral \(\mathbf{p}\)-norm and its higher order power method
- Extreme Ratio Between Spectral and Frobenius Norms of Nonnegative Tensors
- Probabilistic bounds on best rank-1 approximation ratio
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- Maximum relative distance between real rank-two and rank-one tensors
- Chebyshev Polynomials and Best Rank-one Approximation Ratio
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)
