- D.L. Donoho, M. Elad, V.N. Temlyakov, “Stable recovery of sparse overcomplete representations in the presence of noise”, IEEE Trans. Inform. Theory, 52, № 1, 2006, 6
- B. N. Khoromskij, V. Khoromskaia, “Low rank Tucker-type tensor approximation to classical potentials”, centr.eur.j.math., 5, № 3, 2007, 523
- Volker Michel, Lectures on Constructive Approximation, 2013, 183
- V. N. Temlyakov, “Greedy expansions in convex optimization”, Proc. Steklov Inst. Math., 284, № 1, 2014, 244
- Xiu Yang, George Em Karniadakis, “Reweighted minimization method for stochastic elliptic differential equations”, Journal of Computational Physics, 248, 2013, 87
- Wolfgang Hackbusch, Boris N. Khoromskij, “Tensor-product approximation to operators and functions in high dimensions”, Journal of Complexity, 23, № 4-6, 2007, 697
- V.N. Temlyakov, “Weak greedy algorithms[*]This research was supported by National Science Foundation Grant DMS 9970326 and by ONR Grant N00014‐96‐1‐1003.”, Advances in Computational Mathematics, 12, № 2-3, 2000, 213
- Robert Schaback, Holger Wendland, “Adaptive greedy techniques for approximate solution of large RBF systems”, Numerical Algorithms, 24, № 3, 2000, 239
- A. I. Stepanets, “Approximation Characteristics of Spaces
$S_\phi ^p$”, Ukrainian Mathematical Journal, 53, № 3, 2001, 446
- Vladimir Nikolaevich Temlyakov, “Brief introduction in greedy approximation”, Успехи математических наук, 80, № 5(485), 2025, 23