The following pages link to E. D. Livshits (Q206039):
Displaying 19 items.
- On uniform approximation on subsets (Q268096) (← links)
- On greedy algorithms for dictionaries with bounded cumulative coherence (Q368218) (← links)
- On the rate of convergence of a pure greedy algorithm. (Q556558) (← links)
- Realizability of greedy algorithms (Q643840) (← links)
- On adaptive estimators in statistical learning theory (Q666555) (← links)
- Continuous selections of operators of almost best approximation by splines in the space \(L_p[0,1]\). I (Q820295) (← links)
- On \(n\)-term approximation with positive coefficients (Q942052) (← links)
- On a greedy algorithm in the space \(L_p[0,1]\) (Q1033990) (← links)
- Convergence of greedy algorithms in Banach spaces (Q1886103) (← links)
- A weak-type inequality for uniformly bounded trigonometric polynomials (Q2446182) (← links)
- On almost-best approximation by piecewise polynomial functions in the space \(C[0, 1]\) (Q2508725) (← links)
- Generalized approximate weak greedy algorithms (Q2577360) (← links)
- On the efficiency of the Orthogonal Matching Pursuit in compressed sensing (Q2884662) (← links)
- Lower bounds for the rate of convergence of greedy algorithms (Q3405544) (← links)
- Optimality of the greedy algorithm for some function classes (Q3534169) (← links)
- The convergence of the greedy algorithm with respect to the Haar system in the space<i>L<sub>p</sub></i>(0,1) (Q3561098) (← links)
- Stability of the operator of $ \varepsilon$-projection to the set of splines in $ C \lbrack 0,1 \rbrack $ (Q4674582) (← links)
- (Q5395513) (← links)
- Continuous almost best approximations in \(C[0,1]\) (Q5944776) (← links)
