Abstract. We study the convergence of certain greedy algorithms in Banach spaces. We introduce the WN property for Banach spaces and prove that the algorithms converge in the weak topol-ogy for general dictionaries in uniformly smooth Banach spaces with the WN property. We show that reflexive spaces with the uniform Opial property have the WN property. We show that our results do not extend to algorithms which employ a ‘dictionary dual ’ greedy step. 1
AbstractA basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a...
We first introduce an iterative sequence for finding fixed points of relatively nonexpansive mapping...
AbstractIn this paper, we prove a strong convergence theorem for relatively nonexpansive mappings in...
In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. ...
AbstractWe consider weak thresholding greedy algorithms with respect to Markushevich bases in genera...
AbstractWe study a greedy algorithm called the Weak Chebyshev X-Greedy Algorithm (WCXGA) and investi...
AbstractWe study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach ...
Abstract. We consider the X-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional B...
This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a q...
We consider the X-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional Banach spac...
AbstractWe prove that the weak dual greedy algorithm converges in any subspace of a quotient of Lp w...
We study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach space. I...
AbstractWe study the efficiency of greedy type algorithms with regard to redundant dictionaries in H...
In this dissertation we study the questions of convergence and rate of convergence of greedy-type al...
Abstract. This paper is a survey which also contains some new results on the nonlinear approximation...
AbstractA basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a...
We first introduce an iterative sequence for finding fixed points of relatively nonexpansive mapping...
AbstractIn this paper, we prove a strong convergence theorem for relatively nonexpansive mappings in...
In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. ...
AbstractWe consider weak thresholding greedy algorithms with respect to Markushevich bases in genera...
AbstractWe study a greedy algorithm called the Weak Chebyshev X-Greedy Algorithm (WCXGA) and investi...
AbstractWe study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach ...
Abstract. We consider the X-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional B...
This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a q...
We consider the X-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional Banach spac...
AbstractWe prove that the weak dual greedy algorithm converges in any subspace of a quotient of Lp w...
We study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach space. I...
AbstractWe study the efficiency of greedy type algorithms with regard to redundant dictionaries in H...
In this dissertation we study the questions of convergence and rate of convergence of greedy-type al...
Abstract. This paper is a survey which also contains some new results on the nonlinear approximation...
AbstractA basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a...
We first introduce an iterative sequence for finding fixed points of relatively nonexpansive mapping...
AbstractIn this paper, we prove a strong convergence theorem for relatively nonexpansive mappings in...