Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “О возвратном жадном алгоритме”, Изв. РАН. Сер. матем., 70, no. 1, 2006, 95
Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “Об оптимальности жадного алгоритма для некоторых классов функций”, Матем. сб., 198, no. 5, 2007, 95
You Gao, Min Ku, Tao Qian, Jianzhong Wang, “FFT formulations of adaptive Fourier decomposition”, Journal of Computational and Applied Mathematics, 324, 2017, 204
Chunfang Shao, Peixin Ye, “Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries”, Int. J. Wavelets Multiresolut Inf. Process., 15, no. 04, 2017, 1750029
Michael Elad, “Sparse Representations Are Most Likely to Be the Sparsest Possible”, EURASIP J. Adv. Signal Process., 2006, no. 1, 2006, 096247
Vladimir Temlyakov, 163, Monte Carlo and Quasi-Monte Carlo Methods, 2016, 557
Peter Bühlmann, “Boosting for high-dimensional linear models”, Ann. Statist., 34, no. 2, 2006
Li Meiqi, Jin Baisuo, Dong Cuiling, “Multiple structural break estimations for linear regression with dependent observations”, Sci. Sin.-Math., 2023
Maria Charina, Costanza Conti, Massimo Fornasier, “Adaptive frame methods for nonlinear variational problems”, Numer. Math., 109, no. 1, 2008, 45
Alessio Sancetta, “Greedy algorithms for prediction”, Bernoulli, 22, no. 2, 2016