Related papers: Maximal inequalities, frames and greedy algorithms
Finding a maximum-weight matching is a classical and well-studied problem in computer science, solvable in cubic time in general graphs. We consider the specialization called assignment problem where the input is a bipartite graph, and…
A net $(x_\alpha)$ in an $f$-algebra $E$ is called multiplicative order convergent to $x\in E$ if $\lvert x_\alpha-x\rvert u\oc 0$ for all $u\in E_+$. This convergence has been investigated and applied in a recent paper by Ayd{\i}n…
We study problems of maximal symmetry in Banach spaces. This is done by providing an analysis of the structure of small subgroups of the general linear group GL(X), where X is a separable reflexive Banach space. In particular, we provide…
We study distributed algorithms that find a maximal matching in an anonymous, edge-coloured graph. If the edges are properly coloured with $k$ colours, there is a trivial greedy algorithm that finds a maximal matching in $k-1$ synchronous…
Given a category of objects, it is both useful and important to know if all the objects in the category may be realised as sub-objects -- via morphisms in the given category -- of a single object in that category enjoying some nice…
We consider the optimal coverage problem where a multi-agent network is deployed in an environment with obstacles to maximize a joint event detection probability. The objective function of this problem is non-convex and no global optimum is…
We study the problem of maximizing a non-monotone submodular function under multiple knapsack constraints. We propose a simple discrete greedy algorithm to approach this problem, and prove that it yields strong approximation guarantees for…
Coordinate descent with random coordinate selection is the current state of the art for many large scale optimization problems. However, greedy selection of the steepest coordinate on smooth problems can yield convergence rates independent…
We investigate the descriptive complexity of order convergence in separable Banach lattices. While uniform convergence is Borel and $\sigma$-order convergence is known to be ${\bf \Delta}^1_2$, it is unclear in general when $\sigma$-order…
When optimization theorists consider optimization problems in infinite dimensional spaces, they need to deal with closed convex subsets(usually cones) which mostly have empty interior. These subsets often prevent optimization theorists from…
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 propose and analyze batch greedy heuristics for cardinality constrained maximization of non-submodular non-decreasing set functions. We consider the standard greedy paradigm, along with its distributed greedy and stochastic greedy…
A Banach space contains either a minimal subspace or a continuum of incomparable subspaces. General structure results for analytic equivalence relations are applied in the context of Banach spaces to show that if $E_0$ does not reduce to…
The goal of this paper is to study band-dominated operators on Banach spaces with Schauder basis with respect to uniformly locally finite metric spaces as well as the Banach algebras generated by them: the so called uniform Roe algebras. We…
We study the projectivity of the free Banach lattice generated by a lattice $\mathbb{L}$ in two cases: when the lattice is finite, and when the lattice is an infinite linearly ordered set. We prove that in the first case it is projective…
The $m$-point nonlocal problem for the first order differential equation with an operator coefficient in a Banach space $X$ is considered. An exponentially convergent algorithm is proposed and justified provided that the operator…
We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…
We show that there exist infinite-dimensional extremely non-complex Banach spaces, i.e. spaces $X$ such that the norm equality $\|Id + T^2\|=1 + \|T^2\|$ holds for every bounded linear operator $T:X\longrightarrow X$. This answers in the…
An ordering of the vertices of a graph is \emph{connected} if every vertex (but the first) has a neighbor among its predecessors. The greedy colouring algorithm of a graph with a connected order consists in taking the vertices in order, and…
We give several characterizations of order continuous vector lattice homomorphisms between Archimedean vector lattices. We reduce the proofs of some of the equivalences to the case of composition operators between vector lattices of…