Related papers: Cyclic projections in Hadamard spaces

According to the von Neumann-Halperin and Lapidus theorems, in a Hilbert space the iterates of products or, respectively, of convex combinations of orthoprojections are strongly convergent. We extend these results to the iterates of convex…

We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…

In this paper we present two Douglas-Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest…

Slow convergence of cyclic projections implies divergence of random projections and vice versa. Let $L_1,L_2,\dots,L_K$ be a family of $K$ closed subspaces of a Hilbert space. It is well known that although the cyclic product of the…

The method of periodic projections consists in iterating projections onto $m$ closed convex subsets of a Hilbert space according to a periodic sweeping strategy. In the presence of $m\geq 3$ sets, a long-standing question going back to the…

In this paper some Hadamard_type inequalities for product of convex functions of 2-variables on the co-ordinates are given.

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…

We study projective surfaces in $\mathbb{P}^3$ which can be written as Hadamard product of two curves. We show that quadratic surfaces which are Hadamard product of two lines are smooth and tangent to all coordinate planes, and such…

To explore convex optimization on Hadamard spaces, we consider an iteration in the style of a subgradient algorithm. Traditionally, such methods assume that the underlying spaces are manifolds and that the objectives are geodesically…

In a Riemannian manifold a regular convex domain is said to be $\lambda$-convex if its normal curvature at each point is greater than or equal to $\lambda$. In a Hadamard manifold, the asymptotic behaviour of the quotient…

Semimodules over idempotent semirings like the max-plus or tropical semiring have much in common with convex cones. This analogy is particularly apparent in the case of subsemimodules of the n-fold cartesian product of the max-plus semiring…

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…

The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods…

Let $\mathcal{H}$ be an infinite dimensional real or complex separable Hilbert space. We introduce a special type of a bounded linear operator $T$ and its important relation with invariant subspace problem on $\mathcal{H}$: operator $T$ is…

We prove several results concerning the representation of projections on arbitrary Banach spaces. We also give illustrative examples including an example of a generalized bi-circular projection which can not be written as the average of the…

Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…

We consider cyclic $m$-isometries on a complex separable Hilbert space. Such operators are characterized in terms of shifts on abstract spaces of weighted Dirichlet type. Our results resemble those of Agler and Stankus, but our model spaces…

In this paper, we consider the quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces. By using the Legendre property of quadratic forms or the compactness of operators in the presentations of…

We study cocycles (non-autonomous dynamical systems) satisfying a certain squeezing condition with respect to the quadratic form of a bounded self-adjoint operator acting in a Hilbert space. We prove that (under additional assumptions) the…