V. N. Temlyakov, “The Marcinkiewicz-Type Discretization Theorems”, Constr Approx, 48, № 2, 2018, 337
Vladimir Nikolaevich Temlyakov, “Конструктивные разреженные тригонометрические приближения и другие задачи для функций смешанной гладкости”, Математический сборник, 206, № 11, 2015, 131
Entao Liu, Vladimir N. Temlyakov, “The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing”, IEEE Trans. Inform. Theory, 58, № 4, 2012, 2040
S. Nam, M.E. Davies, M. Elad, R. Gribonval, “The cosparse analysis model and algorithms”, Applied and Computational Harmonic Analysis, 34, № 1, 2013, 30
Paul Tseng, “Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise”, IEEE Trans. Inform. Theory, 55, № 2, 2009, 888
Hani Nozari, Mohammad Reza Karami, “Design redundant Chebyshev dictionary with generalized extreme value distribution for sparse approximation and image denoising”, SIViP, 8, № 2, 2014, 327
Fuchang Gao, Ching-Kang Ing, Yuhong Yang, “Metric entropy and sparse linear approximation of ℓq-hulls for 0<q≤1”, Journal of Approximation Theory, 166, 2013, 42
Junhua Tong, Huanyu Jiang, Xiaolong Xu, Chao Fang, 123, Knowledge Engineering and Management, 2011, 33
T. P. Lukashenko, V. A. Sadovnichii, “On orthorecursive expansions in terms of a chain of systems”, Dokl. Math., 79, № 2, 2009, 287
S. J. DILWORTH, E. ODELL, TH. SCHLUMPRECHT, ANDRÁS ZSÁK, “On the convergence of greedy algorithms for initial segments of the Haar basis”, Math. Proc. Camb. Phil. Soc., 148, № 3, 2010, 519