Related papers: Weak greedy algorithms and the equivalence between…
The problem of column subset selection has recently attracted a large body of research, with feature selection serving as one obvious and important application. Among the techniques that have been applied to solve this problem, the greedy…
We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two…
This paper deals with quasi-variational inequality problems (QVIs) in a generic Banach space setting. We provide a theoretical framework for the analysis of such problems which is based on two key properties: the pseudomonotonicity (in the…
For any sequence of positive numbers $(\varepsilon_n)_{n=1}^\infty$ such that $\sum_{n=1}^\infty \varepsilon_n = \infty$ we provide an explicit simple construction of $(1+\varepsilon_n)$-bounded Markushevich basis in a separable Hilbert…
In this paper we settle in the negative the problem of the superreflexivity of Garling sequence spaces by showing that they contain a complemented subspace isomorphic to a non superreflexive mixed-norm sequence space. As a by-product of our…
We study an online allocation problem with sequentially arriving items and adversarially chosen agent values, with the goal of balancing fairness and efficiency. Our goal is to study the performance of algorithms that achieve strong…
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…
It is common, when dealing with quantum processes involving a subsystem of a much larger composite closed system, to treat them as effectively memory-less (Markovian). While open systems theory tells us that non-Markovian processes should…
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
In this paper we introduce the notion of weak differential subordination for martingales and show that a Banach space $X$ is a UMD Banach space if and only if for all $p\in (1,\infty)$ and all purely discontinuous $X$-valued martingales $M$…
We establish that the summability of the series $\sum\varepsilon_n$ is the necessary and sufficient criterion ensuring that every $(1+\varepsilon_n)$ Markushevich basis in a separable Hilbert space is a Riesz basis. Further we show that if…
We study the asymptotic behavior of almost-orbits of abstract evolution systems in Banach spaces with or without a Lipschitz assumption. In particular, we establish convergence, convergence in average and almost-convergence of almost-orbits…
This paper considers a general framework for the study of the existence of quasi-variational and variational solutions to a class of nonlinear evolution systems in convex sets of Banach spaces describing constraints on a linear combination…
In this paper we analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special incoherence property. We apply a powerful nonlinear approximation method -- the Weak…
Greedy expansions with prescribed coefficients have been introduced by V. N. Temlyakov in the frame of Banach spaces. The idea is to choose a sequence of fixed (real) coefficients $\{c_n\}_{n=1}^\infty$ and a fixed set of elements…
In these notes, we study nonlinear embeddings between Banach spaces which are also weakly sequentially continuous. In particular, our main result implies that if a Banach space $X$ coarsely (resp. uniformly) embeds into a Banach space $Y$…
The submodular maximization problem is widely applicable in many engineering problems where objectives exhibit diminishing returns. While this problem is known to be NP-hard for certain subclasses of objective functions, there is a greedy…
We show for several computational problems how classical greedy algorithms for special cases can be derived in a simple way from dynamic programs for the general case: interval scheduling (restricted to unit weights), knapsack (restricted…
We give a complete characterization of $2\pi$-periodic weights $w$ for which the usual trigonometric system forms a quasi-greedy basis for $L^p(\bT;w)$, i.e., bases for which simple thresholding approximants converge in norm. The…
We study the problem of scheduling sensors in a resource-constrained linear dynamical system, where the objective is to select a small subset of sensors from a large network to perform the state estimation task. We formulate this problem as…