Greedy approximation by arbitrary sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3730722 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
- Approximation by simple fractions
- Approximation by simple partial fractions with constraints on the poles. II
- Approximation properties of the most simple fractions
- Asymptotically neutral distributions of electrons and polynomial approximation
- Density of a semigroup in a Banach space
- Geometry of Banach spaces. Selected topics
- Greedy approximation
- On \(n\)-term approximation with positive coefficients
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- On the recursive greedy algorithm
Cited in
(15)- Research work at the Chair of Theory of Functions and Functional Analysis
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Weak limits of consecutive projections and of greedy steps
- Relaxation in greedy approximation
- scientific article; zbMATH DE number 5024023 (Why is no real title available?)
- scientific article; zbMATH DE number 2016952 (Why is no real title available?)
- Example of divergence of a greedy algorithm with respect to an asymmetric dictionary
- Brief introduction in greedy approximation
- Condition of coincidence between greedy approximations and \(m\)-term ones
- Greedy Algorithms and Rational Approximation in One and Several Variables
- Density of quantized approximations
- A note on greedy algorithm
- Greedy approximation
- Consecutive projections and greedy approximation in Hilbert space
- Weak convergence of a greedy algorithm and the WN-property
This page was built for publication: Greedy approximation by arbitrary sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112463)
