Relaxation in greedy approximation
From MaRDI portal
Recommendations
- Greedy approximation
- Greedy approximation
- Greedy approximations
- Greedy approximation in convex optimization
- Greedy in Approximation Algorithms
- Simultaneous approximation by greedy algorithms
- Convergence properties of relaxation algorithms
- Greedy approximation by arbitrary sets
- Relaxation on Optimization Predicates
- Greedy Algorithms and Rational Approximation in One and Several Variables
Cited in
(15)- scientific article; zbMATH DE number 5877344 (Why is no real title available?)
- Greedy approximation in convex optimization
- Schwarz iterative methods: infinite space splittings
- Relaxed NewtonSLRA for approximate GCD
- A unified way of analyzing some greedy algorithms
- Weak convergence of greedy algorithms in Banach spaces
- Sparse approximation of individual functions
- Greedy approximation of characteristic functions
- Greedy algorithms in Banach spaces
- On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces
- Penalized empirical relaxed greedy algorithm for fixed design Gaussian regression
- Comparison of Purely Greedy and Orthogonal Greedy Algorithm
- Approximation by neural networks and learning theory
- On \(n\)-term approximation with positive coefficients
- On the convergence of greedy algorithms for initial segments of the Haar basis
This page was built for publication: Relaxation in greedy approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944229)
