Search Results for author:
Found 7 papers, 1 papers with code
Approximation of functions with small mixed smoothness in the uniform norm
Our focus will be on the behavior of the best $m$-term trigonometric approximation as well as the decay of Kolmogorov and entropy numbers in the uniform norm.
Functional Analysis Numerical Analysis Numerical Analysis
Biorthogonal Greedy Algorithms in Convex Optimization
We show that the following well-known algorithms for convex optimization -- the Weak Chebyshev Greedy Algorithm (co) and the Weak Greedy Algorithm with Free Relaxation (co) -- belong to this class, and introduce a new algorithm -- the Rescaled Weak Relaxed Greedy Algorithm (co).
Numerical Analysis Numerical Analysis Optimization and Control
Sparse approximation by greedy algorithms
It is a survey on recent results in constructive sparse approximation.
Convergence and rate of convergence of some greedy algorithms in convex optimization
The paper gives a systematic study of the approximate versions of three greedy-type algorithms that are widely used in convex optimization.
Chebushev Greedy Algorithm in convex optimization
Chebyshev Greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces.
Sparse approximation and recovery by greedy algorithms in Banach spaces
We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to the case of a Banach space.
