Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “О нижних оценках скорости сходимости жадных алгоритмов”, Изв. РАН. Сер. матем., 73, № 6, 2009, 125
B. Ettinger, N. Sarig, Y. Yomdin, “Linear versus Non-Linear Acquisition of Step-Functions”, J Geom Anal, 18, № 2, 2008, 369
L. Burusheva, V. Temlyakov, “Sparse approximation of individual functions”, Journal of Approximation Theory, 259, 2020, 105471
Dinh Dũng, “Continuous algorithms in adaptive sampling recovery”, Journal of Approximation Theory, 166, 2013, 136
Yun-Bin Zhao, Zhi-Quan Luo, “Dynamic Orthogonal Matching Pursuit for Sparse Data Reconstruction”, IEEE Open J. Signal Process., 4, 2023, 242
D. Bazarkhanov, V. Temlyakov, “Nonlinear tensor product approximation of functions”, Journal of Complexity, 31, № 6, 2015, 867
С. А. Епископосян, Т. М. Григорян, Л. С. Симонян, “О Lp-гриди универсальных функциях относительно обобщенной системы Уолша”, Proceedings of NAS RA. Mathematics, 2022, 17
Anthony Nouy, “Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats”, Numer. Math., 141, № 3, 2019, 743
Entao Liu, Vladimir N. Temlyakov, “Super greedy type algorithms”, Adv Comput Math, 37, № 4, 2012, 493