Best multivalue approximation problems via multi-designs

María José Benac, Noelia Belén Rios, Mariano Ruiz

Published 2022-12-22Version 1

Let ${\mathbf d} =(d_j)_{j\in\mathbb{I}_m}\in \mathbb{N}^m$ be a decreasing set of positive integers, and let $\alpha=(\alpha_i)_{i\in\mathbb{I}_n}$ be a non-increasing set of positive weights. Given a family $\Phi^0=(\mathcal{F}_j^0)_{j\in\mathbb{I}_m}$ of Bessel sequences with $\mathcal{F}_j^0=\{f_{i,j}^0\}_{i\in \mathbb{I}_k}\in (\mathbb{C}^{d_j})^k$ for each $1\leq j\leq m$, our main purpose on this work is to characterize the best approximants of $\Phi^0$ in the set $D(\alpha,\mathbf d)$ of the so-called $(\alpha,\mathbf d)$-designs. That is, $m$-tuples $\Phi=(\mathcal{F}_j)_{j\in\mathbb{I}_m}$ such that each $\mathcal{F}_j=\{f_{i,j}\}_{i\in\mathbb{I}_n}$ is a finite sequence in $\mathbb{C}^{d_j}$, and $\sum_{j\in\mathbb{I}_m}\|f_{i,j}\|^2=\alpha_i$ for $i\in\mathbb{I}_n$. Specifically, in this work we search for minimizers of the Joint Frame Operator Distance (JFOD) function: $\Theta:D(\alpha,\mathbf d)\to \mathbb{R}_{\geq 0} $ given by $$\Theta(\Phi)=\sum_{j=1}^m \| S_{\mathcal{F}_j} - S_{\mathcal{F}^0_j}\|_2^2 \,,$$ where $S_{\mathcal{F}}$ denotes the frame operator of $\mathcal{F}$ and $\|\cdot\|_2$ is the Frobenius norm. Then, we find that local minimizers of $\Theta$ are also global and we propose an algorithm to construct the optimal $(\alpha,\mathbf d)$-desings. As an application of the main result, in the particular case that $m=1$, we also characterize global minimizers of a G-frames problem settled by He, Leng and Xu in 2021.