Related papers: Feasibility problems via paramonotone operators in…
The notion of the angle between two subspaces has a long history, dating back to Friedrichs's work in 1937 and Dixmier's work on the minimal angle in 1949. In 2006, Deutsch and Hundal studied extensions to convex sets in order to analyze…
We prove, under certain conditions, the existence of zeros for a weakly continuous operator on a paracompact topological space into the dual of a Banach space.
Finding a point in the intersection of a collection of closed convex sets, that is the convex feasibility problem, represents the main modeling strategy for many computational problems. In this paper we analyze new stochastic reformulations…
It is introduced an open class of linear operators on Banach and Hilbert spaces such that their non-wandering set is an infinite dimensional topologically mixing subspace. In certain cases, the non-wandering set coincides with the whole…
Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space $X$. Along with algorithms that use exact evaluations, algorithms with approximate evaluations are treated. A priori upper…
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…
In this paper we show that a result of Gross and Kuelbs, used to study Gaussian measures on Banach spaces, makes it possible to construct an adjoint for operators on separable Banach spaces. This result is used to extend well known theorems…
The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…
Let T and C be two Hilbert space operators. We prove that if T is near, in a certain sense, to an operator completely polynomially dominated with a finite bound by C, then T is similar to an operator which is completely polynomially…
Remotal and uniquely remotal sets play an important role in the area of farthest point problem as well as nearest point problem in a Banach space $X.$ In this study, we find some sufficient conditions for remotality and uniquely remotality…
In this paper we describe the surjective linear isometries on a vector valued little Bloch space with range space a strictly convex and smooth complex Banach space. We also describe the hermitian operators and the generalized bi-circular…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
Let $A$ be a positive definite operator on a Hilbert space $H$, and $|||.|||$ be a unitarily invariant norm on $B(H)$. We show that if $f$ is an operator monotone function on $(0,\infty)$ and $n\in \mathbb{N}$, then $|||D^n…
We consider ill-posed linear operator equations with operators acting between Banach spaces. For solution approximation, the methods of choice here are projection methods onto finite dimensional subspaces, thus extending existing results…
The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a…
A bounded operator on a real or complex separable infinite-dimensional Banach space $Z$ is universal in the sense of Glasner and Weiss if for every invertible ergodic measure-preserving transformation $T$ of a standard Lebesgue probability…
In this article we discuss the solvability of some class of fully nonlinear equations, and equations with p-Laplacian in more general conditions by using a new approach given in [1] for studying the nonlinear continuous operator. Moreover…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
This paper considers a networked system with a finite number of users and supposes that each user tries to minimize its own private objective function over its own private constraint set. It is assumed that each user's constraint set can be…
A linear operator $U$ acting boundedly on an infinite-dimensional separable complex Hilbert space $H$ is universal if every linear bounded operator acting on $H$ is similar to a scalar multiple of a restriction of $U$ to one of its…