convex feasibility problem
On the Convex Feasibility Problem
... this problem were obtained. The interest for the convex feasibility problem is motivated by some important applications in specific ...
14
General Iterative Method for Convex Feasibility Problem via the Hierarchical Generalized Variational Inequality Problems
... V I(C, A) , the solution set of the variational inequality, then the HGVIP is called a hierarchical variational inequality problems (HVIP). Many problems in mathematics, for example the signal recovery[16], the power ...
6
Convergence theorems of subgradient extragradient algorithm for solving variational inequalities and a convex feasibility problem
... inequality problem will be denoted by VI(f , C). This problem has numerous applications in many areas of mathematics, such as in partial differential equations, optimal control, optimization, mathematical ...
14
Wireless network positioning as a convex feasibility problem
... In this section, we evaluate the performance of POCS, Hybrid Halfplane POCS, OA, NLS, and CLNS for both LOS and NLOS. Figure 9 depicts the CDFs for different methods for both positive and positive-negative measure- ment ...
15
Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
... the convex feasibility problem by convex combinations of sunny nonexpansive retractions in uniformly convex Banach space see also, O’Hara et ...closed convex subset of a smooth, ...
14
An improved method for solving multiple-sets split feasibility problem
... split feasibility problem (MSSFP) is a gen- eralization of the split feasibility problem (SFP) and the convex feasibility problem (CFP); see ...closed convex sets ...
12
A new monotone hybrid algorithm for a convex feasibiliy problem for an infinite family of nonexpansive-type maps, with applications
... various areas of physical sciences and has been studied well in the framework of Hilbert spaces and has found applications in areas such as image restoration, computer tomography, radiation therapy treatment planning ...
19
Alternating mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings
... which allows asymmetric and partial relations between the variables x and y. The interest is to cover many situations, for instance, in decomposition methods for PDEs, applica- tions in game theory and in ...
12
Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems
... split feasibility problem (MSSFP) contains convex feasibility problem (CFP) and split feasibility problem (SFP) as special cases [, , ...
21
A convergence result on random products of mappings in metric spaces
... Keywords: computerized tomography, convex feasibility problem, convex program- ming, Fejér monotone sequence, image reconstruction, image recovery, innate bounded regularity, Kaczmarz ’ [r] ...
7
Quadratic optimization of fixed points for a family of nonexpansive mappings in Hilbert space
... well-known convex feasibility problem reduces to finding a point in the intersection of the fixed point sets of a family of nonexpan- sive ...The problem of finding an optimal point that ...
13
Iterative Approximation to Convex Feasibility Problems in Banach Space
... with a weakly sequentially continuous duality mapping. By using viscosity approxima- tion methods for a finite family of nonexpansive mappings, it is shown that for any given contractive mapping f : C → C, where C is a ...
19
New strong convergence theorems for split variational inclusion problems in Hilbert spaces
... descent-conjugate gradient algorithm for the split variational inclusion problems in Hilbert spaces. Next, a strong convergence theorem of the proposed algorithm is proved under suitable conditions. As an application, we ...
20
An iterative algorithm for fixed point problem and convex minimization problem with applications
... constrained convex minimization problem and prove that the sequences generated by their schemes converge strongly to a solution of the constrained convex minimization problem (see [] for ...
17
Iterative Algorithm for Approximating Solutions of Maximal Monotone Operators in Hilbert Spaces
... the convex minimization problem of finding a minimizer of a proper lower-semicontinuous convex function and the variational problem of finding a solution of a variational in- ...
8
Convergence analysis of the iterative methods for quasi complementarity problems
... It is obvious dat lemma 3.1 implies that if the convex set involved in both tJe quasi variational inequality and the quasi complementarity problem is a convex cone, then both the problem[r] ...
16
Concentration estimates and the central limit problem for convex bodies
... We can, however, derive the local central lim it property from Theorem 1.1. The idea is th a t in addition to knowing th a t most ge have integrals close to Gaussian, we also know th a t each ge is rather sm ooth. To be ...
81
Method for solving a convex integer programming problem
... a convex integer program which is a nonlinear version of the as- signment ...This problem is reformulated as an equivalent ...original problem is suggested which is based on solving the simple ...
6
Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces
... split feasibility problem, the zero point problem of maximal monotone operators, the minimization problem and the equilibrium problem, and to show that the unique min- imum norm ...
20
Efficient Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs
... paired-domination problem is to find a paired-dominating set of G with minimum ...paired-domination problem on bi- partite graphs has been shown to be ...is convex if there exists an ordering of the ...
5