Answers are grounded in this paper and cite their sources.
We construct an example of an asymmetric dictionary D in a Hilbert space H such that the linear combinations of elements of D with positive coefficients are dense in H , but the greedy algorithm with respect to D , in which the inner product with elements of D (not the modulus of this inner product) is maximized at each step, diverges for some initial element.
No takes yet. Share an insight, caveat, or question.
П. А. Бородин (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: