Tensor-Tensor Products, Group Representations, and Semidefinite Programming
Optimization and Control
2025-07-18 v1 Computer Vision and Pattern Recognition
Numerical Analysis
Numerical Analysis
Representation Theory
Abstract
The -family of tensor-tensor products is a framework which generalizes many properties from linear algebra to third order tensors. Here, we investigate positive semidefiniteness and semidefinite programming under the -product. Critical to our investigation is a connection between the choice of matrix M in the -product and the representation theory of an underlying group action. Using this framework, third order tensors equipped with the -product are a natural setting for the study of invariant semidefinite programs. As applications of the M-SDP framework, we provide a characterization of certain nonnegative quadratic forms and solve low-rank tensor completion problems.
Cite
@article{arxiv.2507.12729,
title = {Tensor-Tensor Products, Group Representations, and Semidefinite Programming},
author = {Alex Dunbar and Elizabeth Newman},
journal= {arXiv preprint arXiv:2507.12729},
year = {2025}
}
Comments
34 Pages, 7 figures