Transactions of the American Mathematical Society, Vol. 355, No. 10 (Oct., 2003), pp. 3861-3886 (26 pages) Given square matrices B and B′ with a poset-indexed block structure (for which an ij block is ...

We analyze two popular semidefinite programming relaxations for quadratically constrained quadratic programs with matrix variables. These relaxations are based on vector lifting and on matrix lifting; ...

A novel AI-acceleration paper presents a method to optimize sparse matrix multiplication for machine learning models, particularly focusing on structured sparsity. Structured sparsity involves a ...