Michael B. McCoy, Joel A. Tropp, “Sharp Recovery Bounds for Convex Demixing, with Applications”, Found Comput Math, 14, № 3, 2014, 503
PeiXin Ye, XiuJie Wei, “Efficiency of weak greedy algorithms for m-term approximations”, Sci. China Math., 59, № 4, 2016, 697
M G Grigoryan, K A Navasardyan, “Universal functions in ‘correction’ problems guaranteeing the convergence of Fourier-Walsh series”, Izv. Math., 80, № 6, 2016, 1057
Gabdolla Akishev, 1676, 2015, 020027
A. A. Sargsyan, “Divergence of the greedy algorithm in the Faber-Schauder system on a continuum cardinality set”, J. Contemp. Mathemat. Anal., 42, № 2, 2007, 109
Ju Sun, Qing Qu, John Wright, “Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture”, IEEE Trans. Inform. Theory, 63, № 2, 2017, 853
Vladislav Kargin, “Lattice Option Pricing By Multidimensional Interpolation”, SSRN Journal, 2003
D.L. Donoho, M. Elad, V.N. Temlyakov, “On Lebesgue-type inequalities for greedy approximation”, Journal of Approximation Theory, 147, № 2, 2007, 185
Andreas Hofinger, “Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm”, Journal of Approximation Theory, 143, № 2, 2006, 159
Stephan Dahlke, Erich Novak, Winfried Sickel, “Optimal approximation of elliptic problems by linear and nonlinear mappings II”, Journal of Complexity, 22, № 4, 2006, 549