[PDF] Top 20 An intermixed iteration for constrained convex minimization problem and split feasibility problem
Has 10000 "An intermixed iteration for constrained convex minimization problem and split feasibility problem" found on our website. Below are the top 20 most common "An intermixed iteration for constrained convex minimization problem and split feasibility problem".
An intermixed iteration for constrained convex minimization problem and split feasibility problem
... We denote the fixed point set of a mapping T by F(T ). Fixed point theory can be ap- plied to variational inequality problems, equilibrium problems, split feasibility problems, optimization problems, etc. ... See full document
22
Iterative methods for constrained convex minimization problem in Hilbert spaces
... the split feasibility problem (say SFP, for short), which was introduced by Censor and Elfving ...the split feasibility problem (SFP) has received much attention (see [, , ... See full document
18
Iterative algorithm of common solutions for a constrained convex minimization problem, a quasi-variational inclusion problem and the fixed point problem of a strictly pseudo-contractive mapping
... It is well known that finding fixed points of nonexpansive mappings is an important topic in the theory of nonexpansive mappings and has wide applications in a number of applied areas, such as the convex ... See full document
15
Regularized gradient projection methods for finding the minimum norm solution of the constrained convex minimization problem
... the constrained convex mini- mization ...the constrained convex minimization problem, where < λ < L+ ...the split feasibility problem and use a ... See full document
12
Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
... On the other hand, based on Theorem . and Theorem ., we will give another two applications of it. In , Censor and Elfving [] introduced the split feasibility problem (SFP). Then various ... See full document
23
An iterative algorithm for fixed point problem and convex minimization problem with applications
... the constrained convex minimization problem for a convex and continuously Fréchet differentiable functional in a real Hilbert ...the split feasibility problem and ... See full document
17
General iterative scheme based on the regularization for solving a constrained convex minimization problem
... It is well known that the regularization method plays an important role in solving a constrained convex minimization problem. In this article, we introduce implicit and explicit iterative ... See full document
15
Some results on a viscosity splitting algorithm in Hilbert spaces
... the problem of finding a zero of the sum of two monotone ...The problem is very general in the sense that it includes, as special cases, convexly constrained linear inverse problems, split ... See full document
15
The constrained multiple sets split feasibility problem and its projection algorithms
... multiple-sets split feasibility problem and the split feasibility problem is Byrne’s CQ algorithm [] which is found to be a gradient-projection method in convex ...the ... See full document
10
Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems
... sets split feasibility problems, system of convex constrained linear inverse problems, convex constrained linear inverse problems, split feasibility problems, ... See full document
21
Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
... each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex ...this split feasibility problem and replace the ... See full document
23
Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
... the split feasibility problem (see Theo- rems ...this problem in the infinite dimensional Hilbert space (see Theorem ...the split feasibility problem which converges ... See full document
23
On iterative solutions of a split feasibility problem with nonexpansive mappings
... Both split feasibility and convex feasibility problems are much related to a number of real- world applications, for example, signal processing, intensity-modulated radiation therapy, and ... See full document
13
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- ... See full document
8
Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
... to this case without any problem. However, the Halpern algorithm would converge slowly because it is based on the steepest descent method (see Section ). Hence, in this case, it would be desirable to execute not ... See full document
11
A damped algorithm for the split feasibility and fixed point problems
... If every closed convex subset of a Hilbert space is the fixed point set of its associating projection, then the split feasibility problem becomes a special case of the split common fixed p[r] ... See full document
9
Index Terms Average Mappings, Constrained Convex
... Theorem 4.1 Let C be a non empty, closed and convex subset of a real Hilbert space H, with 0 ∈ . Suppose that the minimization problem (4) is consistent and let S denote its solution set. Assume ... See full document
7
Wireless network positioning as a convex feasibility problem
... positioning problem as a convex feasibility pro- blem (CFP) and applied the well-known successive projection onto convex sets (POCS) approach to solve the positioning ...the convex ... See full document
15
An improved method for solving multiple-sets split feasibility problem
... In the general case, computing the projection in the MSSFP is difficult to implement. So, Yang [] solves this problem by the relaxed CQ-algorithm. Without loss of generality, take the two-sets split ... See full document
12
Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
... a split variational inclusion problem and give several strong convergence theorems in Hilbert spaces, like the Halpern-Mann type iteration method, the regularized iteration ...a split ... See full document
20
Related subjects