Convergence of Some Greedy Algorithms in Banach Spaces

We consider some theoretical greedy algorithms for approximation in Banach spaces with respect to a general dictionary. We prove convergence of the algorithms for Banach spaces which satisfy certain smoothness assumptions. We compare the algorithms and their rates of convergence when the Banach space is L_p(\mathbbT^d)L_p(\mathbb{T}^d) ($1相似文献   

Duality Gap Estimates for Weak Chebyshev Greedy Algorithms in Banach Spaces

Computational Mathematics and Mathematical Physics - The paper studies weak greedy algorithms for finding sparse solutions of convex optimization problems in Banach spaces. We consider the concept...     

The Weak Chebyshev X-Greedy Algorithm in the unweighted Bergman space

We study a greedy algorithm called the Weak Chebyshev X-Greedy Algorithm (WCXGA) and investigate its application to unweighted Bergman spaces. We first show that the WCXGA converges for a wide class of real and complex Banach spaces and dictionaries. We then prove that certain Bergman spaces and their holomorphic monomial dictionaries belong to the class of Banach spaces for which the WCXGA converges.     

Convergence of Greedy Algorithms in Banach Spaces

We study the convergence of greedy algorithms in Banach spaces. We construct an example of a smooth Banach space, where the X-greedy algorithm converges not for all dictionaries and initial vectors. We also study the R-greedy algorithm, which, along with the X-greedy algorithm, is a generalization of the simple greedy algorithm in Hilbert space. We prove its convergence for a certain class of Banach spaces. In particular, this class contains, the spaces ^p,p 2.     

Lorentz Spaces and Embeddings Induced by Almost Greedy Bases in Banach Spaces

The aim of this paper is to undertake a systematic qualitative study of the built-in symmetry of almost greedy bases in Banach spaces. More specifically, by refining the techniques that Wojtaszczyk used in J Approx Theory 107(2), 293–314 2000 for quasi-greedy bases in Hilbert spaces, we show that an almost greedy basis in a Banach space X naturally induces embeddings that allow sandwiching X between two symmetric sequence spaces. Using classical interpolation techniques in combination with duality, we also explore what we label as interpolation of greedy bases. It is then proved that the only almost greedy basis shared by any two \(\ell _{p}\) spaces is equivalent to the standard unit vector basis and that there is no basis which is simultaneously (normalized and) greedy in two different \(L_{p}\) spaces. As a by-product of our work, we obtain a new characterization of greedy bases in Banach spaces in terms of bounded linear operators.     

Greedy Algorithms with Prescribed Coefficients

We study greedy algorithms in a Banach space from the point of view of convergence and rate of convergence. We concentrate on studying algorithms that provide expansions into a series. We call such expansions greedy expansions. It was pointed out in our previous article that there is a great flexibility in choosing coefficients of greedy expansions. In that article this flexibility was used for constructing a greedy expansion that converges in any uniformly smooth Banach space. In this article we push the flexibility in choosing the coefficients of greedy expansions to the extreme. We make these coefficients independent of an element f ∈ X. Surprisingly, for a properly chosen sequence of coefficients we obtain results similar to the previous results on greedy expansions when the coefficients were determined by an element f.     

The strong approximation property

We introduce and investigate the strong approximation property of Banach spaces which is strictly stronger than the approximation property and at least formally weaker than the weak bounded approximation property. Among others, we show that the weak bounded approximation property is equivalent to a quantitative strengthening of the strong approximation property. Some recent results on the approximation property of Banach spaces and their dual spaces are improved.     

The Bishop–Phelps–Bollobás and approximate hyperplane series properties

We study the Bishop–Phelps–Bollobás property for operators between Banach spaces. Sufficient conditions are given for generalized direct sums of Banach spaces with respect to a uniformly monotone Banach sequence lattice to have the approximate hyperplane series property. This result implies that Bishop–Phelps–Bollobás theorem holds for operators from ${?}_1$ into such direct sums of Banach spaces. We also show that the direct sum of two spaces with the approximate hyperplane series property has such property whenever the norm of the direct sum is absolute.     

The weak metric approximation property

We introduce and investigate the weak metric approximation property of Banach spaces which is strictly stronger than the approximation property and at least formally weaker than the metric approximation property. Among others, we show that if a Banach space has the approximation property and is 1-complemented in its bidual, then it has the weak metric approximation property. We also study the lifting of the weak metric approximation property from Banach spaces to their dual spaces. This enables us, in particular, to show that the subspace of c₀, constructed by Johnson and Schechtman, does not have the weak metric approximation property. The research of the second-named author was partially supported by Estonian Science Foundation Grant 5704 and the Norwegian Academy of Science and Letters.     

Efficiency of weak greedy algorithms for m-term approximations

We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak thresholding greedy algorithm(WTGA) and weak Chebyshev thresholding greedy algorithm.Then we discuss the greedy approximation on some function classes.For some sparse classes induced by uniformly bounded quasi-greedy bases of L_p,1p∞,we show that the WTGA realizes the order of the best m-term approximation.Finally,we compare the efficiency of the weak Chebyshev greedy algorithm(WCGA) with the thresholding greedy algorithm(TGA) when applying them to quasi-greedy bases in L_p,1≤p∞,by establishing the corresponding Lebesgue-type inequalities.It seems that when p2 the WCGA is better than the TGA.     

Products of uniformly noncreasy spaces

We show that finite products of uniformly noncreasy spaces with a strictly monotone norm have the fixed point property for nonexpansive mappings. It gives new and natural examples of superreflexive Banach spaces without normal structure but with the fixed point property.

     

Geometry of spaces of compact operators

We introduce the notion of compactly locally reflexive Banach spaces and show that a Banach space X is compactly locally reflexive if and only if for all reflexive Banach spaces Y. We show that X ^* has the approximation property if and only if X has the approximation property and is compactly locally reflexive. The weak metric approximation property was recently introduced by Lima and Oja. We study two natural weak compact versions of this property. If X is compactly locally reflexive then these two properties coincide. We also show how these properties are related to the compact approximation property and the compact approximation property with conjugate operators for dual spaces.     

Greedy expansions in convex optimization

This paper is a follow-up to the author’s previous paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation for finding sparse solutions of convex optimization problems. We modified there the three most popular greedy algorithms in nonlinear approximation in Banach spaces-Weak Chebyshev Greedy Algorithm, Weak Greedy Algorithm with Free Relaxation, and Weak Relaxed Greedy Algorithm-for solving convex optimization problems. We continue to study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements from a given system of elements. There is an increasing interest in building such sparse approximate solutions using different greedy-type algorithms. In this paper we concentrate on greedy algorithms that provide expansions, which means that the approximant at the mth iteration is equal to the sum of the approximant from the previous, (m ? 1)th, iteration and one element from the dictionary with an appropriate coefficient. The problem of greedy expansions of elements of a Banach space is well studied in nonlinear approximation theory. At first glance the setting of a problem of expansion of a given element and the setting of the problem of expansion in an optimization problem are very different. However, it turns out that the same technique can be used for solving both problems. We show how the technique developed in nonlinear approximation theory, in particular, the greedy expansions technique, can be adjusted for finding a sparse solution of an optimization problem given by an expansion with respect to a given dictionary.     

Greedy Algorithm for General Biorthogonal Systems

We consider biorthogonal systems in quasi-Banach spaces such that the greedy algorithm converges for each xX (quasi-greedy systems). We construct quasi-greedy conditional bases in a wide range of Banach spaces. We also compare the greedy algorithm for the multidimensional Haar system with the optimal m-term approximation for this system. This substantiates a conjecture by Temlyakov.     

On the Banach spaces with the property (V*) of Pelczynski

Summary We consider the Banach spaces with the property (V*) of Pelczynski giving a sufficient condition for a Banach space to have this property as well as a characterization of Banach lattices with the same property. Several other results are given which are concerning relationships among that property and other famous isomorphic properties of Banach spaces. Also a characterization of Banach spaces with property (V*) using Schauder decompositions is given. Some result concerning lifting of that property from a Banach space E to L¹(, E) is presented, too.Work performed under the auspices of G.N.A.F.A. of C.N.R. and partially supported by M.P.I. of Italy (40%).     

一类广义变分不等式组的隐迭代算法

依赖于投影映射的性质,许多学者在Hilbert空间研究了具不同映射的变分不等式组解的逼近问题,但在Banach空间的研究比较少.其主要原因是因为在Banach空间投影映射缺乏很好的性质.本文利用向阳非扩张保核映射(the sunny nonexpansiveretraction mapping)Q_K的性质,导出了一种隐迭代方法.用这一方法,本文的结果把[M.A.Noor,K.I.Noor,Projection algorithms for solving a system of generalvariational inequalities,Nonlinear Analysis,70(2009)2700-2706]的主要成果从Hilbert空间推广到了Banach空间.     

On a fixed point result of Amini-Harandi in strictly convex Banach spaces

Summary Amini-Harandi proved that alternate convexically nonexpansive mappings on non-empty weakly compact convex subsets of strictly convex Banach spaces have fixed points. We prove that Amini-Harandi's result holds also in Banach spaces with the Kadec--Klee property and the result is true for a larger class of mappings. Moreover, we show that the Alspach mapping in L¹[0,1] is not a 2-alternate convexically nonexpansive mapping.     

Tractability results for weighted Banach spaces of smooth functions

We study the L_∞-approximation problem for weighted Banach spaces of smooth d-variate functions, where d can be arbitrarily large. We consider the worst case error for algorithms that use finitely many pieces of information from different classes. Adaptive algorithms are also allowed. For a scale of Banach spaces we prove necessary and sufficient conditions for tractability in the case of product weights. Furthermore, we show the equivalence of weak tractability with the fact that the problem does not suffer from the curse of dimensionality.     

Norm attaining operators and renormings of Banach spaces

We define two geometric concepts of a Banach space, property α and β, which generalize in a certain way the geometric situation ofl andc _o. These properties have been used by J. Lindenstrauss and J. Partington in the study of norm attaining operators. J. Partington has shown that every Banach space may (3+ε)-equivalently be renormed to have property β. We show that many Banach spaces (e.g., every WCG space) may (3+ε)-equivalently be renormed to have property α. However, an example due to S. Shelah shows that not every Banach space is isomorphic to a Banach space with property α.     

The Thresholding Greedy Algorithm, Greedy Bases, and Duality

Some new conditions that arise naturally in the study of the Thresholding Greedy Algorithm are introduced for bases of Banach spaces. We relate these conditions to best n-term approximation and we study their duality theory. In particular, we obtain a complete duality theory for greedy bases.