Related papers: Maximal inequalities, frames and greedy algorithms

We consider problems concerning the partial order structure of the set of spreading models of Banach spaces. We construct examples of spaces showing that the possible structure of these sets include certain classes of finite semi-lattices…

We present an approach to decomposition and factor analysis of matrices with ordinal data. The matrix entries are grades to which objects represented by rows satisfy attributes represented by columns, e.g. grades to which an image is red, a…

Let $X$ and $Y$ be separable Banach spaces. Suppose $Y$ either has a shrinking basis or $Y$ is isomorphic to $C(2^\mathbb{N})$ and $A$ is a subset of weakly compact operators from $X$ to $Y$ which is analytic in the strong operator…

We construct a locally finite graph and a bounded geometry metric space which do not admit a quasi-isometric embedding into any uniformly convex Banach space. Connections with the geometry of $c_0$ and superreflexivity are discussed.

A well-known classical result states that $c_0$ is linearly embeddable in a Banach lattice if and only if it is lattice embeddable. Improving results of H.P.~Lotz, H.P.~Rosenthal and N.~Ghoussoub, we prove that $C[0,1]$ shares this property…

The concept of jump system, introduced by Bouchet and Cunningham (1995), is a set of integer points satisfying a certain exchange property. We consider the minimization of a separable convex function on a jump system. It is known that the…

A Banach symmetric space in the sense of O. Loos is a smooth Banach manifold $M$ endowed with a multiplication map $\mu\colon M \times M \to M$ such that each left multiplication map $\mu_x := \mu(x,\cdot)$ (with $x \in M$) is an involutive…

The existence of a solution, convergence and stability of the penalty method for variational inequalities with nonsmooth unbounded uniformly and properly monotone operators in Banach spase $B$ are investigated. All the objects of the…

This article introduces an innovative mathematical framework designed to tackle non-linear convex variational problems in reflexive Banach spaces. Our approach employs a versatile technique that can handle a broad range of variational…

We study the properties of a simple greedy algorithm for the generation of data-adapted anisotropic triangulations. Given a function f, the algorithm produces nested triangulations and corresponding piecewise polynomial approximations of f.…

We describe and analyse a simple greedy algorithm \2G\ that finds a good 2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A 2-matching is a spanning subgraph of maximum degree two and $G$ is drawn uniformly from…

We propose a duality scheme for solving constrained nonsmooth and nonconvex optimization problems in a reflexive Banach space. We establish strong duality for a very general type of augmented Lagrangian, in which we assume a less…

In this paper, we address the problem of learning the structure of a pairwise graphical model from samples in a high-dimensional setting. Our first main result studies the sparsistency, or consistency in sparsity pattern recovery,…

We study a class of quasi-variational inequality problems defined over infinite dimensional Banach space and deduce sufficient conditions for ensuring solutions to such problems under the upper semi-continuity and pseudomonotonicity…

The purpose of this article is to generalize some known characterizations of Banach space properties in terms of graph preclusion. In particular, it is shown that superreflexivity can be characterized by the non-equi-bi-Lipschitz…

We introduce a localization concept for operator-valued frames, where the quality of localization is measured by the associated operator-valued Gram matrix belonging to some suitable Banach algebra. We prove that intrinsic localization of…

This letter studies the problem of minimizing increasing set functions, or equivalently, maximizing decreasing set functions, over the base of a matroid. This setting has received great interest, since it generalizes several applied…

Constrained maximization of submodular functions poses a central problem in combinatorial optimization. In many realistic scenarios, a number of agents need to maximize multiple submodular objectives over the same ground set. We study such…

The purpose of this paper is to quantify the size of the Lebesgue constants $(L_m)_{m=1}^{\infty}$ associated with the thresholding greedy algorithm in terms of a new generation of parameters that modulate accurately some features of a…

Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…