Related papers: Maximal inequalities, frames and greedy algorithms

Let $X$ be a separable nonquasireflexive Banach space. Let $Y$ be a Banach space isomorphic to a subspace of $X^*$. The paper is devoted to the following questions: 1. Under what conditions does there exist an isomorphic embedding $T:Y\to…

The study of greedy approximation in the context of convex optimization is becoming a promising research direction as greedy algorithms are actively being employed to construct sparse minimizers for convex functions with respect to given…

We consider parametrized linear-quadratic optimal control problems and provide their online-efficient solutions by combining greedy reduced basis methods and machine learning algorithms. To this end, we first extend the greedy control…

For a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space the associated conditionality constants $k_{m}[\mathcal{B}]$ verify the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$. Answering a question raised by Temlyakov, Yang,…

It is an open problem whether an infinite-dimensional amenable Banach algebra exists whose underlying Banach space is reflexive. We give sufficient conditions for a reflexive, amenable Banach algebra to be finite-dimensional (and thus a…

We consider nonlinear inverse problems described by operator equations in Banach spaces. Assuming conditional stability of the inverse problem, that is, assuming that stability holds on a closed, convex subset of the domain of the operator,…

Enlargements have proven to be useful tools for studying maximally monotone mappings. It is therefore natural to ask in which cases the enlargement does not change the original mapping. Svaiter has recently characterized non-enlargeable…

We are interested in the question when a Banach space $X$ with an unconditional basis is isomorphic (as a Banach space) to an order-continuous nonatomic Banach lattice. We show that this is the case if and only if $X$ is isomorphic as a…

We show that the left/right relation on the set of s-t-paths of a plane graph induces a so-called submodular lattice. If the embedding of the graph is s-t-planar, this lattice is even consecutive. This implies that Ford and Fulkerson's…

We introduce a class of budgeted prize-collecting covering subgraph problems. For an input graph with prizes on the vertices and costs on the edges, the aim of these problems is to find a connected subgraph such that the cost of its edges…

We study Matching and other related problems in a partial information setting where the agents' utilities for being matched to other agents are hidden and the mechanism only has access to ordinal preference information. Our model is…

We propose a variant of the classical augmented Lagrangian method for constrained optimization problems in Banach spaces. Our theoretical framework does not require any convexity or second-order assumptions and allows the treatment of…

Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the…

We establish estimates for the Lebesgue parameters of the Chebyshev Weak Thresholding Greedy Algorithm in the case of general bases in Banach spaces. These generalize and slightly improve earlier results in [9], and are complemented with…

Learning of low-rank matrices is fundamental to many machine learning applications. A state-of-the-art algorithm is the rank-one matrix pursuit (R1MP). However, it can only be used in matrix completion problems with the square loss. In this…

We prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general case of Banach spaces. The new ingredient of the paper is that we bound the…

A net $(x_\alpha)$ in a Banach lattice $X$ is said to un-converge to a vector $x$ if $\bigl\lVert\lvert x_\alpha-x\rvert\wedge u\bigr\rVert\to 0$ for every $u\in X_+$. In this paper, we investigate un-topology, i.e., the topology that…

Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the…

We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter…

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…