Related papers: Maximal inequalities, frames and greedy algorithms
The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional)…
In this paper, using generalized metric projection, we propose a new extragradient method for finding a common element of the solutions set of a generalized equilibrium problem and a variational inequality for an $\alpha$-inverse-strongly…
A net $(x_\alpha)_{\alpha\in \Gamma}$ in a vector lattice $X$ is unbounded order convergent (uo-convergent) to $x$ if $|x_\alpha-x| \wedge y \xrightarrow{o} 0$ for each $y \in X_+$, and is unbounded order Cauchy (uo-Cauchy) if the net…
A matching in a bipartite graph with parts X and Y is called envy-free if no unmatched vertex in X is a adjacent to a matched vertex in Y. Every perfect matching is envy-free, but envy-free matchings exist even when perfect matchings do…
The notion of almost everywhere convergence has been generalized to vector lattices as unbounded order convergence, which proves a very useful tool in the theory of vector and Banach lattices. In this short note, we establish some new…
Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for…
We investigate the performance of the standard Greedy algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions. While there are strong theoretical guarantees on the performance of Greedy for…
Dimensionality reduction on quadratic manifolds augments linear approximations with quadratic correction terms. Previous works rely on linear approximations given by projections onto the first few leading principal components of the…
Property~(A) is a week symmetry condition that plays a fundamental role in the characterization of greedy-type bases in the isometric case, i.e., when the constants involved in the study of the efficiency of the thresholding greedy…
Motivated by recent work on stochastic gradient descent methods, we develop two stochastic variants of greedy algorithms for possibly non-convex optimization problems with sparsity constraints. We prove linear convergence in expectation to…
We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean of the valuations of the…
In many prediction problems, it is not uncommon that the number of variables used to construct a forecast is of the same order of magnitude as the sample size, if not larger. We then face the problem of constructing a prediction in the…
We study mechanisms that use greedy allocation rules and pay-your-bid pricing to allocate resources subject to a matroid constraint. We show that all such mechanisms obtain a constant fraction of the optimal welfare at any equilibrium of…
Symmetry in mathematical programming may lead to a multiplicity of solutions. In nonconvex optimisation, it can negatively affect the performance of the branch-and-bound algorithm. Symmetry may induce large search trees with multiple…
Collective communications are ubiquitous in parallel applications. We present two new algorithms for performing a reduction. The operation associated with our reduction needs to be associative and commutative. The two algorithms are…
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…
For a non-empty locally compact Hausdorff space $X$ and a Dedekind complete normal vector lattice $E$, we show that the vector lattice of norm to order bounded operators from ${\text C}_{\text c}(X)$ or ${\text C}_0(X)$ into $E$ is…
We prove that if $\mathcal{X}$ is a quasi-greedy Markushevich basis of a Banach space $\mathbb{X}$, its dual basis $\mathcal{X}^*$ spans a norming subspace of $\mathbb{X}^*$. We also prove this result for weaker forms of quasi-greediness,…
Let $X$ be a Banach space. We prove that, for a large class of Banach or quasi-Banach spaces $E$ of $X$-valued sequences, the sets $E-\bigcup _{q\in\Gamma}\ell_{q}(X)$, where $\Gamma$ is any subset of $(0,\infty]$, and $E-c_{0}(X)$ contain…
In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are…