Volker Michel, Lectures on Constructive Approximation, 2013, 13
André Uschmajew, “Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations”, Numer. Math., 115, № 2, 2010, 309
Tomoyuki Obuchi, Yoshiyuki Kabashima, “Sparse approximation problem: how rapid simulated annealing succeeds and fails”, J. Phys.: Conf. Ser., 699, 2016, 012017
Abhimanyu Das, David Kempe, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 45
Alfred M. Bruckstein, David L. Donoho, Michael Elad, “From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images”, SIAM Rev., 51, № 1, 2009, 34
Adam Lutoborski, Vladimir N. Temlyakov, “Vector greedy algorithms”, Journal of Complexity, 19, № 4, 2003, 458
Yoshinori Nakanishi-Ohno, Tomoyuki Obuchi, Masato Okada, Yoshiyuki Kabashima, “Sparse approximation based on a random overcomplete basis”, J. Stat. Mech., 2016, № 6, 2016, 063302
Laura Rebollo-Neira, Zhiqiang Xu, “Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval”, Signal Processing, 90, № 7, 2010, 2308
Virginie Ehrlacher, Maria Fuente Ruiz, Damiano Lombardi, “SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains”, SIAM J. Sci. Comput., 44, № 2, 2022, A664
David L. Donoho, Yaakov Tsaig, Iddo Drori, Jean-Luc Starck, “Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit”, IEEE Trans. Inform. Theory, 58, № 2, 2012, 1094