(Created page with "== Abstract == A norm minimization problem posed in K-dimensional finite arrays without non-negativity constraints was efficiently solved by Romero Romero. Going beyond we pr...") |
m (Scipediacontent moved page Draft Content 435291320 to Calvillo-Vives et al 2020a) |
(No difference)
| |
Latest revision as of 16:12, 26 November 2020
Abstract
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.
Full document
Back to Top
GET PDF
Document information
Published on 14/12/18
Submitted on 30/11/18
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?