Vector greedy algorithms
From MaRDI portal
Publication:652444
General theory of numerical analysis in abstract spaces (65J05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary linear expressions (41A45)
Recommendations
- scientific article; zbMATH DE number 5024023
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- Realizability of greedy algorithms
- Weak greedy algorithms
- On convergence of weak greedy algorithms
- Convergence of orthogonal greedy algorithm with errors in projectors
- Two lower estimates in greedy approximation
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Projection greedy algorithm
- Approximate weak greedy algorithms
Cites work
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 1264507 (Why is no real title available?)
- A criterion for convergence of weak greedy algorithms
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Adaptive greedy approximations
- Asymptotics of the module of a degenerating condenser and some of their applications
- CART and best-ortho-basis: a connection
- Compression of Wavelet Decompositions
- Estimate of approximate characteristics for classes of functions with bounded mixed derivative
- Greedy algorithm and \(m\)-term trigonometric approximation
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Nonlinear approximation by trigonometric sums
- Nonlinear approximation in finite-dimensional spaces
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\)
- Projection pursuit
- Rates of convex approximation in non-Hilbert spaces
- Remarks on projection pursuit regression and density estimation
- Some remarks on greedy algorithms
- The best \(m\)-term approximation and greedy algorithms
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Universal approximation bounds for superpositions of a sigmoidal function
- Weak greedy algorithms
Cited in
(25)- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- Approximation on anisotropic Besov classes with mixed norms by standard information
- Realizability of greedy algorithms
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Super greedy type algorithms
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- Example of divergence of a greedy algorithm with respect to an asymmetric dictionary
- Column subset selection via sparse approximation of SVD
- Weak greedy algorithms
- Projection greedy algorithm
- Comparison of Purely Greedy and Orthogonal Greedy Algorithm
- Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries
- Variable selection in high-dimensional sparse multiresponse linear regression models
- A counter-example to the general convergence of partially greedy algorithms
- Adaptive martingale approximations
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- scientific article; zbMATH DE number 2111760 (Why is no real title available?)
- On the recursive greedy algorithm
- On greedy algorithms for dictionaries with bounded cumulative coherence
- On a greedy algorithm in the space \(L_p[0,1]\)
- Adaptive greedy approximations
- Simultaneous greedy approximation in Banach spaces
- Conical greedy algorithm
- Greedy approximations
- Simultaneous approximation by greedy algorithms
This page was built for publication: Vector greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652444)
