Pages that link to "Item:Q2431116"
From MaRDI portal
The following pages link to Greedy approximation with regard to non-greedy bases (Q2431116):
Displayed 27 items.
- Efficiency of weak greedy algorithms for \(m\)-term approximations (Q294506) (← links)
- Lebesgue-type inequalities for quasi-greedy bases (Q387546) (← links)
- An inequality for the entropy numbers and its application (Q390538) (← links)
- Characterization of greedy bases in Banach spaces (Q505893) (← links)
- Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
- On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces (Q905956) (← links)
- Conditional quasi-greedy bases in non-superreflexive Banach spaces (Q1755510) (← links)
- Entropy numbers and Marcinkiewicz-type discretization (Q2039830) (← links)
- On optimal recovery in \(L_2\) (Q2041064) (← links)
- Marcinkiewicz-type discretization of \(L^p\)-norms under the Nikolskii-type inequality assumption (Q2049338) (← links)
- Sampling discretization and related problems (Q2136857) (← links)
- Biorthogonal greedy algorithms in convex optimization (Q2155817) (← links)
- Connections between numerical integration, discrepancy, dispersion, and universal discretization (Q2178666) (← links)
- Sparse approximation of individual functions (Q2209292) (← links)
- Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness (Q2238847) (← links)
- Sampling discretization error of integral norms for function classes (Q2274411) (← links)
- A unified way of analyzing some greedy algorithms (Q2329295) (← links)
- Lebesgue constants for the weak greedy algorithm (Q2348348) (← links)
- SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES (Q2879425) (← links)
- Sparse Approximation by Greedy Algorithms (Q4609500) (← links)
- New parameters and Lebesgue-type estimates in greedy approximation (Q5058359) (← links)
- Sparse approximation of some function classes with respect to multiple Haar system on the unit cube (Q5062183) (← links)
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (Q5348776) (← links)
- \(n\)-best kernel approximation in reproducing kernel Hilbert spaces (Q6051151) (← links)
- Random points are good for universal discretization (Q6074492) (← links)
- Sampling discretization error of integral norms for function classes with small smoothness (Q6165573) (← links)
- Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes (Q6185418) (← links)
