[PDF] Top 20 On the Convex Feasibility Problem
Has 10000 "On the Convex Feasibility Problem" found on our website. Below are the top 20 most common "On the Convex Feasibility Problem".
On the Convex Feasibility Problem
... The paper is organized as follows. In section 2 we briefly state the convergence properties of the Mann iteration process. The projection algorithm is a particular case of this iteration, so that its convergence results ... See full document
14
General Iterative Method for Convex Feasibility Problem via the Hierarchical Generalized Variational Inequality Problems
... the convex feasibility problem (CFP) in the case that each closed convex set is a solution set of gen- eralized variational inequality and exhibits an algorithm for finding solution of the ... See full document
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 ... See full document
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 ... See full document
15
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 [, , ... See full document
21
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 ... See full document
19
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 ... See full document
12
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 ... See full document
12
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 ... See full document
13
Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
... It should be noted that the block iterative algorithm is a method which often used by many authors to solve the convex feasibility problem see, e.g., Kikkawa and Takahashi 11, Aleyner and Reich 12. ... See full document
14
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] ... See full document
7
Extragradient method for convex minimization problem
... point problem of a strictly pseudocontractive ...inequality problem (over the fixed point set of a strictly pseudocontractive map- ping) with constraints of finitely many GMEPs, finitely many variational ... See full document
40
Convergence theorems for split equality generalized mixed equilibrium problems for demi contractive mappings
... equilibrium problem has been extensively studied, beginning with Blum and Oettli [] where they proposed it as a generalization of optimization and variational inequality ...equilibrium problem deals with ... See full document
25
Global passivity enforcement via convex optimization
... enforcement problem is formulated as a convex optimization problem and efficiently solved based on recently developed interior-point ...The convex optimization is a special class of ... See full document
13
Fekete Szegö Problem for a New Class of Analytic Functions
... which are analytic in the open unit disk U {z : z ∈ C and |z| < 1} and S denote the subclass of A that are univalent in U. A function fz in A is said to be in class S ∗ of starlike functions of order zero in U, if Rzf ... See full document
6
Iterative Approximation to Convex Feasibility Problems in Banach Space
... Theorem 3.2. Let E be a reflexive Banach space which admits a weakly sequentially con- tinuous normalized duality mapping J from E to E ∗ . Let C be a nonempty closed convex subset of E which is also a sunny ... See full document
19
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 ... See full document
17
New strong convergence theorems for split variational inclusion problems in Hilbert spaces
... mapping if Tx – Ty ≤ x – y for every x, y ∈ C. T is said to be a quasi-nonexpansive mapping if Fix(T ) = ∅ and Tx – y ≤ x – y for every x ∈ C and y ∈ Fix(T ). It is easy to see that Fix(T ) is a closed convex ... See full document
20
Iterative Algorithm for Approximating Solutions of Maximal Monotone Operators in Hilbert Spaces
... the convex mini- mization problem of finding a minimizer of a proper lower-semicontinuous convex func- tion and the variational problem of finding a solution of a variational ... See full document
8
Beampattern Synthesis with Linear Matrix Inequalities Using Minimal Array Sensors
... Abstract—A new beampattern synthesis formulation is proposed to compute the minimum number of array sensors required. In order to satisfy all the prescribed specifications of the beampattern, the proposed method imposes ... See full document
12
Related subjects