Related papers: Averaged alternating reflections in geodesic space…
This paper is concerned with the development and analysis of an iterative solver for high-dimensional second-order elliptic problems based on subspace-based low-rank tensor formats. Both the subspaces giving rise to low-rank approximations…
In this paper, we introduce three new iterative methods for finding a common point of the set of fixed points of a symmetric generalized hybrid mapping and the set of solutions of an equilibrium problem in a real Hilbert space. Each method…
Even after several decades of systematic usage of X-ray diffraction as one of the major analytical tool for epitaxic layers, the vision of the reciprocal space of these materials is still a simple superposition of two reciprocal lattices,…
In this paper, we consider the Halpern iteration scheme for a finite family of quasinonexpansive mappings and then prove a strong convergence theorem to their common fixed point in a complete geodesic space with curvature bounded above by…
While adaptive sensing has provided improved rates of convergence in sparse regression and classification, results in nonparametric regression have so far been restricted to quite specific classes of functions. In this paper, we describe an…
We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in contrast to the work [17], where the single vector signal can be…
This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages…
We obtain a general concept of triplet of Hilbert spaces with closed (unbounded) embeddings instead of continuous (bounded) ones. The construction starts with a positive selfadjoint operator $H$, that is called the Hamiltonian of the…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
We construct a class of super-reflexive complementably minimal spaces, and study uniformly convex distortions of the norm on Hilbert space by using methods of complex interpolation.
We consider a geodesic flow on a compact manifold endowed with a Riemannian (or Finsler, or Lorentz) metric satisfying some generic, explicit conditions. We couple the geodesic flow with a time-dependent potential, driven by an external…
Many iterative methods for solving optimization or feasibility problems have been invented, and often convergence of the iterates to some solution is proven. Under favourable conditions, one might have additional bounds on the distance of…
In this paper we provide a unified treatment of some convex minimization problems, which allows for a better understanding and, in some cases, improvement of results in this direction proved recently in spaces of curvature bounded above.…
Given $A$ and $B$ two nonempty subsets in a metric space, a mapping $T : A \cup B \rightarrow A \cup B$ is relatively nonexpansive if $d(Tx,Ty) \leq d(x,y) \text{for every} x\in A, y\in B.$ A best proximity point for such a mapping is a…
We give an asymptotic formula as $t\to+\infty$ for the number of common perpendiculars of length at most $t$ between two divergent geodesics or a divergent geodesic and a compact locally convex subset in negatively curved locally symmetric…
We study the convergence of specific inexact alternating projections for two non-convex sets in a Euclidean space. The $\sigma$-quasioptimal metric projection ($\sigma \geq 1$) of a point $x$ onto a set $A$ consists of points in $A$ the…
Feasibility problem aims to find a common point of two or more closed (convex) sets whose intersection is nonempty. In the literature, projection based algorithms are widely adopted to solve the problem, such as the method of alternating…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
We study the limiting behavior of multiple ergodic averages involving several not necessarily commuting measure preserving transformations. We work on two types of averages, one that uses iterates along combinatorial parallelepipeds, and…
We consider the problem of variable selection in high-dimensional sparse additive models. We focus on the case that the components belong to nonparametric classes of functions. The proposed method is motivated by geometric considerations in…