Brief introduction in greedy approximation
From MaRDI portal
Cites work
- A criterion for convergence of weak greedy algorithms
- A mathematical introduction to compressive sensing
- A remark on greedy approximation in Banach spaces.
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- A unified way of analyzing some greedy algorithms
- Adaptive greedy approximations
- Alternating projections, remotest projections, and greedy approximation
- Approximate Carathéodory's theorem in uniformly smooth Banach spaces
- Approximation and learning by greedy algorithms
- Bilinear approximation and applications
- Biorthogonal greedy algorithms in convex optimization
- Comparison of Purely Greedy and Orthogonal Greedy Algorithm
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- Composite integral operators and nuclearity
- Conical dual greedy algorithm in a Banach space
- Conical greedy algorithm
- Convergence and rate of convergence of some greedy algorithms in convex optimization
- Convergence of greedy algorithms in Banach spaces
- Convergence of remote projections onto convex sets
- Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces.
- Convex optimization on Banach spaces
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung).
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Estimates of best bilinear approximations of functions and approximation numbers of integral operators
- Estimates of best bilinear approximations of periodic functions
- ESTIMATES OF SINGULAR NUMBERS OF INTEGRAL OPERATORS
- ESTIMATES OF THE BEST BILINEAR APPROXIMATIONS OF FUNCTIONS OF TWO VARIABLES AND SOME OF THEIR APPLICATIONS
- Example of divergence of a greedy algorithm with respect to an asymmetric dictionary
- Generalized approximate weak greedy algorithms
- Greedy algorithms and M-term approximation with regard to redundant dictionaries
- Greedy algorithms in Banach spaces
- Greedy algorithms with prescribed coefficients
- Greedy approximation
- Greedy approximation by arbitrary sets
- Greedy approximation in Banach spaces
- Greedy approximation in convex optimization
- Greedy approximations
- Greedy expansions in Banach spaces
- Greedy expansions with prescribed coefficients in Hilbert spaces
- Greedy sparsity-constrained optimization
- Greedy-type approximation in Banach spaces and applications
- scientific article; zbMATH DE number 43504 (Why is no real title available?)
- scientific article; zbMATH DE number 578735 (Why is no real title available?)
- scientific article; zbMATH DE number 2079345 (Why is no real title available?)
- scientific article; zbMATH DE number 3288044 (Why is no real title available?)
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces
- Lebesgue-type inequalities in greedy approximation
- Lower bounds for the rate of convergence of greedy algorithms
- Matrix and tensor rigidity and L_p-approximation
- Multivariate approximation
- Nonlinear methods of approximation
- Nonlinear tensor product approximation of functions
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- On convergence of weak greedy algorithms
- On greedy approximation in complex Banach spaces
- On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces
- On the characteristic values of linear integral equations.
- On the coincidence of pure greedy and best \(m\)-term approximations
- On the rate of convergence of greedy algorithms.
- On the theory of linear and nonlinear integral equations. I: Expansion of arbitrary functions by fixed function systems. II: Solution of the general linear integral equation
- Projection pursuit
- Rate of convergence of pure greedy algorithm.
- Rates of convex approximation in non-Hilbert spaces
- Relaxation in greedy approximation
- Rescaled pure greedy algorithm for convex optimization
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Sequential greedy approximation for certain convex optimization problems
- Sharp conditions for the convergence of greedy expansions with prescribed coefficients
- Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation
- Some remarks on greedy algorithms
- Sparse Approximation and Recovery by Greedy Algorithms
- Sparse approximation and recovery by greedy algorithms in Banach spaces
- Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
- Sur une classe d'équations fonctionnelles.
- The eigen-values and singular values of integral equations.
- Trading accuracy for sparsity in optimization problems with sparsity constraints
- Twenty-five years of greedy bases
- Two lower estimates in greedy approximation
- Universal approximation bounds for superpositions of a sigmoidal function
- Weak greedy algorithms
- Weak limits of consecutive projections and of greedy steps
This page was built for publication: Brief introduction in greedy approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866431)
