E. D. Livshits

From MaRDI portal
Revision as of 22:27, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:206039

Available identifiers

zbMath Open livshits.e-dMaRDI QIDQ206039

List of research outcomes





PublicationDate of PublicationType
On uniform approximation on subsets2016-04-14Paper
A weak-type inequality for uniformly bounded trigonometric polynomials2014-04-16Paper
On greedy algorithms for dictionaries with bounded cumulative coherence2013-09-18Paper
On the efficiency of the Orthogonal Matching Pursuit in compressed sensing2012-05-30Paper
On adaptive estimators in statistical learning theory2012-03-08Paper
Realizability of greedy algorithms2011-11-02Paper
The convergence of the greedy algorithm with respect to the Haar system in the spaceLp(0,1)2010-05-25Paper
Lower bounds for the rate of convergence of greedy algorithms2010-02-10Paper
On a greedy algorithm in the space \(L_p[0,1\)]2009-11-10Paper
Optimality of the greedy algorithm for some function classes2008-11-03Paper
On \(n\)-term approximation with positive coefficients2008-09-03Paper
https://portal.mardi4nfdi.de/entity/Q53955132006-10-31Paper
On almost-best approximation by piecewise polynomial functions in the space \(C[0, 1\)]2006-10-20Paper
Continuous selections of operators of almost best approximation by splines in the space \(L_p[0,1\). I]2006-04-06Paper
Generalized approximate weak greedy algorithms2005-12-19Paper
On the rate of convergence of a pure greedy algorithm.2005-06-21Paper
Stability of the operator of $ \varepsilon$-projection to the set of splines in $ C \lbrack 0,1 \rbrack $2005-05-17Paper
Convergence of greedy algorithms in Banach spaces2004-11-15Paper
Continuous almost best approximations in \(C[0,1\)]2001-01-01Paper

Research outcomes over time

This page was built for person: E. D. Livshits