On an optimal problem of bilinear forms
From MaRDI portal
The aim of this paper is to find upper bounds for\N\begin{align*}\N\sup_{\|u_j\| = \|v_k\| = 1} \sum_{j,k=1}^n a_{jk} \langle u_j, v_k \rangle\N\end{align*}\Nwhere \(A=(a_{jk})\) is a real matrix and \(u_j, v_k\) are unit vectors in \(\mathbb R^d\). Using Lagrange multipliers, the authors find a necessary condition for the maximum of the above expression. Then they specialise to the case \(n=d=2\) and a symmetric matrix \(A\) and give explicit values for the maximum in terms of the components of the matrix \(A\).
Cites work
- Approximating the Cut-Norm via Grothendieck's Inequality
- Grothendieck-type inequalities in combinatorial optimization
- Grothendieck’s Theorem, past and present
- scientific article; zbMATH DE number 3124239 (Why is no real title available?)
- scientific article; zbMATH DE number 3913045 (Why is no real title available?)
- Towards Grothendieck constants and LHV models in quantum mechanics
This page was built for publication: On an optimal problem of bilinear forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988516)