On norm compression inequalities for partitioned block tensors
type: Item
instance of: scholarly article
title: On norm compression inequalities for partitioned block tensors
zbMATH Open document ID: 1436.15027
author: Zhening Li
author: Yun-Bin Zhao
published in: Calcolo
publication date: 2020-04-21T00:00:00Z
Mathematics Subject Classification ID: 15A69
Mathematics Subject Classification ID: 15A60
Mathematics Subject Classification ID: 15A45
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 65F55
zbMATH DE Number: 7190871
zbMATH Keywords: norm compression inequality
zbMATH Keywords: spectral norm
zbMATH Keywords: tensor partition
zbMATH Keywords: block tensor
zbMATH Keywords: rank-one approximation
MaRDI profile type: MaRDI publication profile
full work available at URL: s10092-020-0356-x
OpenAlex ID: W3006445651
Wikidata QID: Q114228541
cites work: Chebyshev Polynomials and Best Rank-one Approximation Ratio
cites work: A norm compression inequality for block partitioned positive semidefinite matrices
cites work: On a norm compression inequality for \(2\times N\) partitioned block matrices
cites work: Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
cites work: Quantum information theory
cites work: Norm inequalities for partitioned operators and an application
cites work: Adaptive covariance matrix estimation through block thresholding
cites work: Maximum block improvement and polynomial optimization
cites work: On the tensor spectral \(p\)-norm and its dual norm via partitions
cites work: On the nuclear norm and the singular value decomposition of tensors
cites work: Nuclear norm of higher-order tensors
cites work: A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
cites work: Q4917542
cites work: Probability Bounds for Polynomial Functions in Random Variables
cites work: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
cites work: Approximation algorithms for discrete polynomial optimization
cites work: Most Tensor Problems Are NP-Hard
cites work: Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
cites work: Relations of the nuclear norm of a tensor and its matrix flattenings
cites work: Tensor principal component analysis via convex optimization
cites work: Inequalities for trace norms of \(2\times 2\) block matrices.
cites work: New trace norm inequalities for \(2\times 2\) blocks of diagonal matrices
cites work: Tensor Decompositions and Applications
cites work: Q2941673
cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
cites work: Q5292203
cites work: Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
cites work: Approximation Methods for Polynomial Optimization
cites work: On Orthogonal Tensors and Best Rank-One Approximation Ratio
cites work: Blind Multilinear Identification
cites work: Semidefinite Relaxations for Best Rank-1 Tensor Approximations
cites work: Combinatorial methods for the spectral \(p\)-norm of hypermatrices
cites work: The Best Rank-One Approximation Ratio of a Tensor Space
cites work: Block tensor unfoldings
cites work: Block tensors and symmetric embeddings
cites work: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
cites work: Equivalence constants for matrix norms: A problem of Goldberg
cites work: Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking
cites work: Operator norm inequalities between tensor unfoldings on the partition lattice
cites work: The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
DOI: 10.1007/S10092-020-0356-X
description: scientific article; zbMATH DE number 7190871