Best multi-valued approximants via multi-designs (2212.12004v2)
Abstract: Let ${\mathbf d} =(d_j){j\in\mathbb{I}_m}\in \mathbb{N}m$ be a decreasing finite sequence of positive integers, and let $\alpha=(\alpha_i){i\in\mathbb{I}n}$ be a finite and non-increasing sequence of positive weights. Given a family $\Phi0=(\mathcal{F}_j0){j\in\mathbb{I}m}$ of Bessel sequences with $\mathcal{F}_j0={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 the $m$-tuple of frame operators of the elements of $\Phi0$ in the set $D(\alpha,\mathbf d)$ of the so-called $(\alpha,\mathbf d)$-designs, which are the $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 completely characterize the 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}|_22 \,,$$ where $S_{\mathcal{F}}$ denotes the frame operator of $\mathcal{F}$ and $|\cdot|_2$ is the Frobenius norm. Indeed, we show that local minimizers of $\Theta$ are also global and we obtain 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 recently considered by He, Leng and Xu.