A norm minimization problem posed in K-dimensional finite arrays without non-negativity constraints was efficiently solved by Romero Romero. Going beyond we provide here an explicit, exact solution in case the arrays are replaced by L2-Hilbert spaces. Furthermore, we propose a polynomial procedure yielding an approximate optimal solution when non-negativity constraints must be taken into account for K = 2.
Published on 14/12/18
Submitted on 30/11/18
Licence: CC BY-NC-SA license
Are you one of the authors of this document?