Related papers: Maximal inequalities, frames and greedy algorithms

Several concept learning problems can be regarded as special cases of half-space separation in abstract closure systems over finite ground sets. For the typical scenario that the closure system is implicitly given via a closure operator, we…

Submodular maximization has been widely studied over the past decades, mostly because of its numerous applications in real-world problems. It is well known that the standard greedy algorithm guarantees a worst-case approximation factor of…

If $K$ is a compact Hausdorff space so that the Banach lattice $C(K)$ is isometrically lattice isomorphic to a dual of some Banach lattice, then $C(K)$ can be decomposed as the $\ell^\infty$-direct sum of the carriers of a maximal singular…

When developing robust preconditioners for multiphysics problems, fractional functions of the Laplace operator often arise and need to be inverted. Rational approximation in the uniform norm can be used to convert inverting those fractional…

This paper is a follow up to the previous author's 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…

For two countable ordinals $\alpha$ and $\beta$, a basis of a Banach space $X$ is said to be $(\alpha, \beta)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_\alpha$-unconditional but not $\mathcal{S}_{\alpha+1}$-unconditional, and…

In this paper, we describe how to get Janet decomposition for a finite set of terms and detect completeness of that set by means of the associated Bar Code. Moreover, we explain an algorithm to find a variable ordering (if it exists) s.t. a…

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

Given a map $f \colon E \longrightarrow F$ between Banach spaces (or Banach lattices), a set $A$ of $E$-valued bounded sequences, ${\bf x} \in A$ and a vector topology $\tau$ on $F$, we investigate the existence of an infinite dimensional…

We explore the relation between lattice versions of strict singularity for operators from a Banach lattice to a Banach space. In particular, we study when the class of disjointly strictly singular operators, those not invertible on the span…

This paper concerns parameterized convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional Banach (resp. finite-dimensional) spaces and that are indexed by an arbitrary fixed set T…

Let $X$ be a Banach space with the unit ball $B(X)$ and $A\subset X$ be a convex origin-symmetric compact in $X$. Let $\mathrm{j}:X\rightarrow \widetilde{X}$ be an isometric extension of $X$. It is well-known that linear widths $\lambda…

We study the greedy (exploitation-only) algorithm in bandit problems with a known reward structure. We allow arbitrary finite reward structures, while prior work focused on a few specific ones. We fully characterize when the greedy…

Let $X$ be a Banach space and $\mathcal{K}$ be a compact subset in $X$. We consider a greedy algorithm for finding an $n$-dimensional subspace $V_n\subset X$ which can be used to approximate the elements of $\mathcal{K}$. We are interested…

The distinction between conditional, unconditional, and absolute convergence in infinite-dimensional spaces has fundamental implications for computational algorithms. While these concepts coincide in finite dimensions, the Dvoretzky-Rogers…

Ordered vector spaces E and F are said to be order isomorphic if there is a (not necessarily linear) bijection between them that preserves order. We investigate some situations under which an order isomorphism between two Banach lattices…

The greedy algorithm for monotone submodular function maximization subject to cardinality constraint is guaranteed to approximate the optimal solution to within a $1-1/e$ factor. Although it is well known that this guarantee is essentially…

In this note, we show that the order convergence in a vector lattice $X$ is not topological unless $\dim X<\infty$. Furthermore, we show that, in atomic order continuous Banach lattices, the order convergence is topological on order…

For the past 25 years, one of the most studied algorithms in the field of Nonlinear Approximation Theory has been the Thresholding Greedy Algorithm. In this paper, we propose new summability methods for this algorithm, generating two new…

In this paper, two generalized algorithms for solving the variational inequality problem in Banach spaces are proposed. Then the strong convergence of the sequences generated by these algorithms will be proved under the suitable conditions.…