Research Article Self-Adaptive and Relaxed Self-Adaptive Projection Methods for Solving the Multiple-Set Split Feasibility Problem
|
|
- Mabel Bryan
- 5 years ago
- Views:
Transcription
1 Abstract and Applied Analysis Volume 01, Article ID , 11 pages doi: /01/ Research Article Self-Adaptive and Relaxed Self-Adaptive Proection Methods for Solving the Multiple-Set Split Feasibility Problem Ying Chen, 1 Yuansheng Guo, Yanrong Yu, and Rudong Chen 1 Textile Division, Tianin Polytechnic University, Tianin , China Department of Mathematics, Tianin Polytechnic University, Tianin , China Correspondence should be addressed to Rudong Chen, chenrd@tpu.edu.cn Received 10 October 01; Accepted 17 November 01 Academic Editor: Yongfu Su Copyright q 01 Ying Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Given nonempty closed convex subsets C i R m, i 1,,...,tand nonempty closed convex subsets Q R n, 1,,...,r,inthen- andm-dimensional Euclidean spaces, respectively. The multipleset split feasibility problem MSSFP proposed by Censor is to find a vector x t i1 C i such that Ax r 1 Q,whereA is a given M N real matrix. It serves as a model for many inverse problems where constraints are imposed on the solutions in the domain of a linear operator as well as in the operator s range. MSSFP has a variety of specific applications in real world, such as medical care, image reconstruction, and signal processing. In this paper, for the MSSFP, we first propose a new self-adaptive proection method by adopting Armio-like searches, which dose not require estimating the Lipschitz constant and calculating the largest eigenvalue of the matrix A T A; besides, it makes a sufficient decrease of the obective function at each iteration. Then we introduce a relaxed self-adaptive proection method by using proections onto half-spaces instead of those onto convex sets. Obviously, the latter are easy to implement. Global convergence for both methods is proved under a suitable condition. 1. Introduction The multiple-sets split feasibility problem MSSFP requires to find a point closest to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space. It is formulated as follows: Find a x C : t C i i1 r such that Ax Q : Q, 1 1.1
2 Abstract and Applied Analysis where nonempty closed convex sets C i R n,i 1,,...,t,inthen-dimensional Euclidean space R n, and nonempty closed convex sets Q R m, 1,,...,r,inthem-dimensional Euclidean space R m. A is an m n real matrix. Specially, the problem with only a single set C in R n and a single set Q in R m was introduced by Censor and Elfving 1 and was called the split feasibility problem SFP. Such MSSFPs 1.1, proposedin, arise in signal processing, image reconstruction and so on. Various algorithms have been invented to solve MSSFP 1.1. See 5 and references therein. In, Censor and Elfving were handling the MSSFP 1.1, for both the consistent and the inconsistent cases, where they aim at minimizing the proximity function ) 1 t ) 1 r Px α i P Ci x x PQ β Ax Ax. i For convenience reasons, they consider an additional closed convex set Ω R n. Their algorithm for the MSSFP 1.1 involves orthogonal proection onto Ω R n,c i R n,i 1,,...,t,andQ R m, 1,,...,r, which were assumed to be easily calculated and has the following iterative step: x k1 P Ω x k γ t α i P Ci x k) x k) i1 r β i A T P Q Ax k) Ax k), where α i > 0, i 1,,...,t. β > 0, 1,,...,r. γ 0, /L, L 1 t i1 α i λ r 1 β is the Lipschitz constant of Px, which is the gradient of the proximity function Px defined by 1., andλ is the spectral radius of the matrix A T A. For any starting vector x 0 R n,the algorithm converges to a solution of the MSSFP 1.1, whenever MSSFP 1.1 has a solution. In the inconsistent case, it find a point closest to all sets. This algorithm uses a fixed stepsize related to the Lipschitz constant L, which sometimes computing it may be hard. On the other hand, even if we ow the Lipschitz constant L, the method with fixed stepsize may lead to slow speed of convergence. In 005, Qu and Xiu 6 modified the CQ algorithm 7 and relaxed CQ algorithm 8 by adopting Armio-like searches to solve the SFP, where the second algorithm used orthogonal proections onto half-spaces instead of proections onto the original convex sets, ust as Yang s relaxed CQ algorithm 8. This may reduce a lot of work for computing proections, since proections onto half-spaces can be directly calculated. Motivated by Qu and Xiu s idea, Zhao and Yang in 4 introduce a self-adaptive proection method by adopting Armio-like searches to solve the MSSFP 1.1 and propose a relaxed self-adaptive proection method by using orthogonal proections onto half-spaces instead of these proections onto the original convex sets, which is more practical. But the same as Algorithm 1.3, Zhao and Yang s algorithm involves an addition proection P Ω. Though the MSSFP 1.1 includes the SFP as a special case, the Zhao and Yang s algorithm does not reduce to Qu and Xiu s modifications of the CQ algorithm 6. In this paper, We first proposed a self-adaptive method by adopting Armio-like searches to solve the MSSFP 1.1 without an addition proection P Ω, then a relaxed selfadaptive proection method was introduced which only involves orthogonal proections onto
3 Abstract and Applied Analysis 3 half-spaces, so that the algorithm is implementable. We need not estimate the Lipschitz constant and make a sufficient decrease of the obection function at each iteration; besides, these proection algorithms can reduce to the modifications of the CQ algorithm 6 when the MSSFP 1.1 is reduced to the SFP. We also show convergence the algorithms under mild conditions.. Preliminaries In this section, we give some definitions and basic results that will be used in this paper. Definition.1. An operator F from a set X R n into R n is called a monotone on X, if Fx F y ),x y 0, x, y X;.1 b cocoercive on X with constant α>0, if Fx F y ),x y α Fx F y ), x, y X;. c Lipschitz continuous on X with constant λ>0, if Fx F y ) λ x y, x, y X..3 In particular, if λ 1, F is said to be nonexpansive. It is easily seen from the definitions that cocoercive mappings are monotone. Definition.. Functions fx, differentiable on a nonempty convex set S, is pseudoconvex if for every x 1,x S, the condition fx 1 <fx implies that fx T x 1 x 0..4 It is own that differentiable convex functions are pseudoconvex see 9. For a given nonempty closed convex set Ω in R n, the orthogonal proection from R n onto Ω is defined by P Ω x argmin { x y y Ω }, x R n..5 Lemma.3 see 10. Let Ω be a nonempty closed convex subset in R n, then, for any x, y R n and z Ω. 1 P Ω x x, z P Ω x 0; P Ω x P Ω y P Ω x P Ω y,x y ; 3 P Ω x z xz P Ω x x.
4 4 Abstract and Applied Analysis From Lemma.3 ), one sees that the orthogonal proection mapping P Ω x is cocoercive with modulus 1, monotone, and nonexpansive. Let F be a mapping from R n into R n. For any x R n and α>0, define xα P Ω x αfx, ex, α x xα. Lemma.4 see 6. Let F be a mapping from R n into R n. For any x R n and α>0, one has min{1,α} ex, 1 ex, α max{1,α} ex, 1. Lemma.5 see 5, 9. Suppose h : R n R is a convex function, then it is subdifferentiable everywhere and its subdifferentials are uniformly bounded on any bounded subset of R n. 3. Self-Adaptive Proection Iterative Scheme and Convergence Results It is easily seen that if the solution set of MSSFP 1.1 is nonempty, then the MSSFP 1.1 is equivalent to the minimization problem of q over all x C : t i1 C i. qx is defined by ) 1 r PQ qx β Ax Ax, where β > 0. Note that the gradient of qx is r qx β A T I P Q )Ax Consider the following constrained minimization problem: min { qx, x C }. 3.3 We say that a point x C is a stationary point of the problem 3.3 if it satisfies the condition qx,x x 0, x C. 3.4 This optimization problem is proposed by Xu 3 for solving the MSSFP 1.1; the q defined by 3. is L-Lipschitzian with L A r 1 β and q is 1/L-ism. Algorithm 3.1. Given constant β>0, σ 0, 1. Letx 0 be arbitrary. For k 0, 1,..., calculate x k1 P Ck1 x k τ k qxx k), 3.5 where C n C n mod N and mod function takes values in 1,,...,N, τ k βγ l k and l k is the smallest nonnegative integer l such that q P Ck1 x k βγ l qxx k)) q x k) σ q x k),x k P Ck1 x k βγ l qxx k). 3.6
5 Abstract and Applied Analysis 5 Algorithm 3.1 need not estimate the largest eigenvalue of the matrix A T A,andthe stepsize τ k is chosen so that the obective function qx has a sufficient decrease. It is in fact a special case of the standard gradient proection method with the Armio-like search rule for solving the constrained optimization problem: min { gx; x Ω }, 3.7 where Ω R n is a nonempty closed convex set, and the function gx is continuously differentiable on Ω, then the following convergence result ensures the convergence of Algorithm 3.1. Lemma 3. see 6. Let g C 1 Ω be pseudoconvex and xk be an infinite sequence generated by the gradient proection method with the Armio-like searches. Then, the following conclusions hold: 1 lim k gx k inf{gx : x Ω}; /Ω, which denotes the set of the optimal solutions to 3.7, if and only if there exists at least one limit point of {x k }. In this case, {x k } converges to a solution of 3.7. Since the function qx is convex and continuously differentiable on C, therefore it is pseudoconvex. Then, by Lemma 3., one immediately obtains the following convergence result. Theorem 3.3. Let {x k } be a sequence generated by Algorithm 3.1, then the following conclusions hold: 1 {x k } is bounded if and only if the solution set of 3.3 is nonempty. In such a case, {x k } must converge to a solution of 3.3. {x k } is bounded and lim k qx k 0if and only if the MSSFP 1.1 is solvable. In such a case, {x k } must converge to a solution of MSSFP 1.1. However, in Algorithm 3.1, it costs a large amount of work to compute the orthogonal proections P Ci and P Q ; therefore, the same as Censor s method, these proections are assumed to be easily calculated. But, in some cases it is difficult or costs too much work to exactly compute the orthogonal proection, then the efficiency of these methods will be deeply affected. In what follows, one assume that the proections are not easily calculated. One present a relaxed self-adaptive proection method. Carefully speaking, the convex sets C i and Q satisfy the following assumptions. 1 The sets C i, i 1,,...,t. are given by C i {x R n c i x 0}, 3.8 where c i : R n R, i 1,,...,t, are convex functions. The sets Q, 1,,...,r. are given by Q { y R m q y ) 0 }, 3.9 where q : R m R, 1,,...,r, are convex functions.
6 6 Abstract and Applied Analysis For any x R n, at least one subgradient ξ i c i x can be calculated, where c i x is a generalized gradient subdifferential of c i x at x and it is defined as follows: c i x {ξ i R n c i z c i x ξ i,z x z R n } For any y R m, at least one subgradient η i q y can be calculated, where q y is a generalized gradient subdifferential of q y at y and it is defined as the following: q y ) { η R m q u q y ) η,u y u R m} In the kth iteration, let C k i {x R n c i x k) } ξ k i,x xk 0, 3.1 where ξ k i is an element in c i x k,i 1,,...,t. Consider Q k {y R m q Ax k) } η k,y Axk 0, 3.13 where η k is an element in q Ax k,1,,...,r. By the definition of the subgradient, it is clear that C i C k i,q Q k and the orthogonal proections onto C k i and Q k can be calculated 4, 6, 8. Define q k x 1 ) r 1 β PQ k Ax Ax, 3.14 where β > 0. Then q k x r 1 β A T I P Q k ) Ax For the Lipschiitz constant and the cocoercive modulus of q defined by 3. are not related to the nonempty closed convex sets C i and Q 3, one can obtain that the q k x is L-Lipschitzian with L A r 1 β and 1/L-ism. So, q k x is monotone. Algorithm 3.4. Given constant γ>0, α 0, 1 μ 0, 1.Letx 0 be arbitrary. For k 0, 1,,..., compute x k P C k x k ρ k q k x k)), k1 3.16
7 Abstract and Applied Analysis 7 where ρ k γα l k and l k is the smallest non-negative interger l such that q k x k) q k x k) x k x k μ ρ k Set x k1 P C k x k ρ k q k x k)). k Lemma 3.5. The Armio-like search rule 3.17 is well defined, and μα/l ρ k γ. Proof. Obviously, from 3.17, ρ k γ for k 0, 1,... We ow that ρ k /α must violate inequality 3.17.Thatis, q k x k) q k P C k x k ρ k k1 α q k x k))) μ x k P C k k1 x k ρ k /α ) q )) k x k ρ k /α Since q k is Lipschitz continuous with constant L, which together with 3.19, we have ρ k > μα L, 3.0 which completes the proof. Theorem 3.6. Let {x k } be a sequence generated by Algorithm 3.4. If the solution set of the MSSFP 1.1 is nonempty, the {x k } converges to a solution of the MSSFP 1.1. Proof. Let x be a solution of the MSSFP 1.1, then x P C x P Ci x,i1,,...,t.and Ax P Q Ax P Q x,1,,...,r. Since C i C k i,q Q k for all i and, we have x C k i, Ax Q k,and,q kx 0; thus, we have q k x 0for all k 0, 1,... Using the monotonicity of q k,wehaveforallk 0, 1,... q k x k) q k x, x k x This implies q k x k), x k x q k x, x k x Therefore, we have q k x k),x k1 x q k x k),x k1 x k. 3.3
8 8 Abstract and Applied Analysis Thus, using part 3 of Lemma.3 and 3.3, weobtain x k1 x PC k x k ρ k q k x k)) x k1 x k ρ k q k x k) x x k1 x k ρ k q k x k) x k x ρk q k x k),x k x ρ k q k x k),x k1 x k x k x ρk q k x k),x k1 x k x k x ρk q k x k),x k1 x k x k x k x k x k,x k1 x k x k1 x k x k1 x k x k x k x k1 x k x k x x k x k x k1 x k x k x k ρ k q k x k),x k1 x k. 3.4 Since x k P C k x k ρ k q k x k, x k1 C k k1 k1.bylemma.31, we have xk x k ρ k q k x k,x k1 x k 0; also, by search rule 3.17, it follows that x k1 x x k x x k x k x k1 x k x k x k ρ k q k x k),x k1 x k x k x k ρ k q k x k),x k1 x k x k x x k x k x k1 x k ρ k q k x k) q k x k),x k1 x k x k x x k x k x k1 x k ρ k q k x k) q k x k) x k1 x k x k x x k x k μ x k x k x k x 1 μ ) x k x k, 3.5
9 Abstract and Applied Analysis 9 which implies that the sequence { x k x } is monotonically decreasing and hence {x k } is bounded. Consequently, we get from 3.5 lim x k x k k On the other hand x k1 x k x k1 x k x k x k x k ρ k q k x k) x k ρ k q k x k) x k x k qk ρ k x k) q k x k) x k x k 3.7 μ 1 ) x k x k, which results in lim x k1 x k 0. k 3.8 Let x be an accumulation point of {x k } and x k n x, where {x k n } n1 is a subsequence of {x k }. We will show that x is a solution of the MSSFP 1.1. Thus, we need to show that x C t i1 C i and A x Q r 1 Q. Since x 1 C k n k n 1, for all n 1,,..., then by the definition of Ck n k n, we have 1 c ki 1 x k n ) ξ k n1 k n 1,xk n1 x k n Passing onto the limit in this inequality and taking into account 3.9 and Lemma 3., we obtain that c 1 x 0withk n. Because C 1 is repeated regularly of C 1,C,...,C t,so x C i for every 1 i t;thus, x C t i1 C i. Next, we need to show A x Q r 1 Q. Let e k x, ρ x P C k x ρ q k x,k 0, 1,,..., then e x k n,ρ x k n x k n and k1 we get from Lemmas.4 and 3.,and3.6 that lim e x k n, 1) lim k n k n x k n x k n min { } lim 1,ρ k n x k n x k n min { 1, ρ } 0, 3.30 where ρ μα/l. Since x is a solution point of MSSFP 1.1, sox C i,i 1,,...,t.By using Lemma.3, we have 0 ) )) )) x k n q x k n P C x k n q x k n,p 1 C x k n q x k n x 1 ) ) e x k n, 1 q x k n ),x k n x e x k n,
10 10 Abstract and Applied Analysis From Lemma.3, we see that orthogonal proection mappings are cocoercive with modulus 1, taking into account the fact that the mapping F is cocoercive with modulus 1 if and only if I F is cocoercive with modulus 1 6, weobtainfrom3.31 and q x 0 that ) ) x k n x,e x k n, 1 e x k n ), 1 q x k n ),e x k n, 1 ) q x k n q x,x k n x ) e x k n ), 1 q x k n ),e x k n, 1 r ) β A I T P Q Ax n) k A T I P Q )Ax,x k n x 1 ) e x k n ), 1 q x k n ),e x k n, 1 r 1 β I P Q ) Ax n) k I P Q ) e x k n ), 1 q x k n ),e x k n, 1 )Ax,Ax k n Ax r 1 β Ax k n P Q ) Ax k n. 3.3 Since q x k n q x k n q x L x k n x and {x k n } is abounded, the sequence q x k n is also bounded. Therefore, from 3.30 and 3.3, wegetforall 1,,...,that lim Axk n P Q Ax n) k k n Moreover, since P Q Ax k n Q k n, we have ) q Ax k n η k n,p Q ) Ax k n Ax k n 0, 1,...,r Again passing onto the limits and combining those inequalities with Lemma.5, we conclude by 3.33 that q A x 0, 1,...,r Thus, x C t i1 C i and A x Q r 1 Q.
11 Abstract and Applied Analysis 11 Therefore, x is a solution of the MSSFP 1.1. So we may use x in place of x in 3.3 and get that the sequence { x k x } is convergent. Furthermore, noting that a subsequence of {x k },thatis,{x k n }, converges to x, weobtainthatx k x, ask. This completes the proof. 4. Concluding Remarks This paper introduced two self-adaptive proection methods with the Armio-like searches for solving the multiple-set split feasibility problem MSSFP 1.1. They need not compute the additional proection P Ω and avoid the difficult task of estimating the Lipschitz constant. It makes a sufficient decrease of the obective function at each iteration; thus the efficiency is enhanced greatly. Moreover in the second algorithm, we use the relaxed proection technology to calculate orthogonal proections onto convex sets, which may reduce a large amount of computing work and make the method more practical. The corresponding convergence theories have been established. Acowledgment This paper was supported partly by NSFC Grants no References 1 Y. Censor and T. Elfving, A multiproection algorithm using Bregman proections in a product space, Numerical Algorithms, vol. 8, no., pp. 1 39, Y. Censor, T. Elfving, N. Kopf, and T. Bortfeld, The multiple-sets split feasibility problem and its applications for inverse problems, Inverse Problems, vol. 1, no. 6, pp , H. K. Xu, A variable Krasnosel skii-mann algorithm and the multiple-set split feasibility problem, Inverse Problems, vol., no. 6, pp , J. L. Zhao and Q. Z. Yang, Self-adaptive proection methods for the multiple-sets split feasibility problem, Inverse Problems, vol. 7, no. 3, Article ID , G. Lopez, V. Martin, and H. K. Xu, Iterative algorithms for the multiple-sets split feasibility problem, in Biomedical Mathematics: Promising Directions in Imaging, Therapy Planning and Inverse Problems, Y. Censor, M. Jiang, and G. Wang, Eds., pp , Medical Physics, Madison, Wis, USA, B. Qu and N. H. Xiu, A note on the CQ algorithm for the split feasibility problem, Inverse Problems, vol. 1, no. 5, pp , C. Byrne, Iterative oblique proection onto convex sets and the split feasibility problem, Inverse Problems, vol. 18, no., pp , Q. Yang, The relaxed CQ algorithm solving the split feasibility problem, Inverse Problems, vol. 0, no. 4, pp , R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, USA, E. H. Zarantonello, Proections on Convex Sets in Hilbert Space and Spectral Theory, Universityof Wisconsin Press, Madison, Wis, USA, 1971.
12 Advances in Operations Research Volume 014 Advances in Decision Sciences Volume 014 Applied Mathematics Algebra Volume 014 Probability and Statistics Volume 014 The Scientific World Journal Volume 014 International Differential Equations Volume 014 Volume 014 Submit your manuscripts at International Advances in Combinatorics Mathematical Physics Volume 014 Complex Analysis Volume 014 International Mathematics and Mathematical Sciences Mathematical Problems in Engineering Mathematics Volume 014 Volume 014 Volume 014 Volume 014 Discrete Mathematics Volume 014 Discrete Dynamics in Nature and Society Function Spaces Abstract and Applied Analysis Volume 014 Volume 014 Volume 014 International Stochastic Analysis Optimization Volume 014 Volume 014
Research Article Modified Halfspace-Relaxation Projection Methods for Solving the Split Feasibility Problem
Advances in Operations Research Volume 01, Article ID 483479, 17 pages doi:10.1155/01/483479 Research Article Modified Halfspace-Relaxation Projection Methods for Solving the Split Feasibility Problem
More informationResearch Article Some Krasnonsel skiĭ-mann Algorithms and the Multiple-Set Split Feasibility Problem
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2010, Article ID 513956, 12 pages doi:10.1155/2010/513956 Research Article Some Krasnonsel skiĭ-mann Algorithms and the Multiple-Set
More informationResearch Article An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem
Abstract and Applied Analysis, Article ID 60813, 5 pages http://dx.doi.org/10.1155/014/60813 Research Article An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem Luoyi
More informationThe Split Common Fixed Point Problem for Asymptotically Quasi-Nonexpansive Mappings in the Intermediate Sense
International Mathematical Forum, Vol. 8, 2013, no. 25, 1233-1241 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2013.3599 The Split Common Fixed Point Problem for Asymptotically Quasi-Nonexpansive
More informationResearch Article Strong Convergence of a Projected Gradient Method
Applied Mathematics Volume 2012, Article ID 410137, 10 pages doi:10.1155/2012/410137 Research Article Strong Convergence of a Projected Gradient Method Shunhou Fan and Yonghong Yao Department of Mathematics,
More informationINERTIAL ACCELERATED ALGORITHMS FOR SOLVING SPLIT FEASIBILITY PROBLEMS. Yazheng Dang. Jie Sun. Honglei Xu
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 200X doi:10.3934/xx.xx.xx.xx pp. X XX INERTIAL ACCELERATED ALGORITHMS FOR SOLVING SPLIT FEASIBILITY PROBLEMS Yazheng Dang School of Management
More informationOn the split equality common fixed point problem for quasi-nonexpansive multi-valued mappings in Banach spaces
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 (06), 5536 5543 Research Article On the split equality common fixed point problem for quasi-nonexpansive multi-valued mappings in Banach spaces
More informationIterative algorithms based on the hybrid steepest descent method for the split feasibility problem
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 (206), 424 4225 Research Article Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem Jong Soo
More informationA NEW ITERATIVE METHOD FOR THE SPLIT COMMON FIXED POINT PROBLEM IN HILBERT SPACES. Fenghui Wang
A NEW ITERATIVE METHOD FOR THE SPLIT COMMON FIXED POINT PROBLEM IN HILBERT SPACES Fenghui Wang Department of Mathematics, Luoyang Normal University, Luoyang 470, P.R. China E-mail: wfenghui@63.com ABSTRACT.
More informationResearch Article Algorithms for a System of General Variational Inequalities in Banach Spaces
Journal of Applied Mathematics Volume 2012, Article ID 580158, 18 pages doi:10.1155/2012/580158 Research Article Algorithms for a System of General Variational Inequalities in Banach Spaces Jin-Hua Zhu,
More informationResearch Article Cyclic Iterative Method for Strictly Pseudononspreading in Hilbert Space
Journal of Applied Mathematics Volume 2012, Article ID 435676, 15 pages doi:10.1155/2012/435676 Research Article Cyclic Iterative Method for Strictly Pseudononspreading in Hilbert Space Bin-Chao Deng,
More informationA New Modified Gradient-Projection Algorithm for Solution of Constrained Convex Minimization Problem in Hilbert Spaces
A New Modified Gradient-Projection Algorithm for Solution of Constrained Convex Minimization Problem in Hilbert Spaces Cyril Dennis Enyi and Mukiawa Edwin Soh Abstract In this paper, we present a new iterative
More informationNew Iterative Algorithm for Variational Inequality Problem and Fixed Point Problem in Hilbert Spaces
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 20, 995-1003 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.4392 New Iterative Algorithm for Variational Inequality Problem and Fixed
More informationIterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem
Iterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem Charles Byrne (Charles Byrne@uml.edu) http://faculty.uml.edu/cbyrne/cbyrne.html Department of Mathematical Sciences
More informationThe Strong Convergence Theorems for the Split Equality Fixed Point Problems in Hilbert Spaces
Applied Mathematical Sciences, Vol. 2, 208, no. 6, 255-270 HIKARI Ltd, www.m-hikari.com https://doi.org/0.2988/ams.208.86 The Strong Convergence Theorems for the Split Equality Fixed Point Problems in
More informationResearch Article Solving the Matrix Nearness Problem in the Maximum Norm by Applying a Projection and Contraction Method
Advances in Operations Research Volume 01, Article ID 357954, 15 pages doi:10.1155/01/357954 Research Article Solving the Matrix Nearness Problem in the Maximum Norm by Applying a Projection and Contraction
More informationA General Iterative Method for Constrained Convex Minimization Problems in Hilbert Spaces
A General Iterative Method for Constrained Convex Minimization Problems in Hilbert Spaces MING TIAN Civil Aviation University of China College of Science Tianjin 300300 CHINA tianming963@6.com MINMIN LI
More informationThe Split Hierarchical Monotone Variational Inclusions Problems and Fixed Point Problems for Nonexpansive Semigroup
International Mathematical Forum, Vol. 11, 2016, no. 8, 395-408 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2016.6220 The Split Hierarchical Monotone Variational Inclusions Problems and
More informationResearch Article Hybrid Algorithm of Fixed Point for Weak Relatively Nonexpansive Multivalued Mappings and Applications
Abstract and Applied Analysis Volume 2012, Article ID 479438, 13 pages doi:10.1155/2012/479438 Research Article Hybrid Algorithm of Fixed Point for Weak Relatively Nonexpansive Multivalued Mappings and
More informationGENERAL NONCONVEX SPLIT VARIATIONAL INEQUALITY PROBLEMS. Jong Kyu Kim, Salahuddin, and Won Hee Lim
Korean J. Math. 25 (2017), No. 4, pp. 469 481 https://doi.org/10.11568/kjm.2017.25.4.469 GENERAL NONCONVEX SPLIT VARIATIONAL INEQUALITY PROBLEMS Jong Kyu Kim, Salahuddin, and Won Hee Lim Abstract. In this
More informationExtensions of the CQ Algorithm for the Split Feasibility and Split Equality Problems
Extensions of the CQ Algorithm for the Split Feasibility Split Equality Problems Charles L. Byrne Abdellatif Moudafi September 2, 2013 Abstract The convex feasibility problem (CFP) is to find a member
More informationResearch Article Solvability of a Class of Integral Inclusions
Abstract and Applied Analysis Volume 212, Article ID 21327, 12 pages doi:1.1155/212/21327 Research Article Solvability of a Class of Integral Inclusions Ying Chen and Shihuang Hong Institute of Applied
More informationStrong Convergence of an Algorithm about Strongly Quasi- Nonexpansive Mappings for the Split Common Fixed-Point Problem in Hilbert Space
Strong Convergence of an Algorithm about Strongly Quasi- Nonexpansive Mappings for the Split Common Fixed-Point Problem in Hilbert Space Lawan Bulama Mohammed 1*, Abba Auwalu 2 and Salihu Afis 3 1. Department
More informationResearch Article A New Global Optimization Algorithm for Solving Generalized Geometric Programming
Mathematical Problems in Engineering Volume 2010, Article ID 346965, 12 pages doi:10.1155/2010/346965 Research Article A New Global Optimization Algorithm for Solving Generalized Geometric Programming
More informationPerturbed Projections and Subgradient Projections for the Multiple-Sets Split Feasibility Problem
Perturbed Projections and Subgradient Projections for the Multiple-Sets Split Feasibility Problem Yair Censor (yair@math.haifa.ac.il) Avi Motova (avimotova@walla.com) and Alexander Segal (asegal@math.haifa.ac.il)
More informationResearch Article Convergence Theorems for Infinite Family of Multivalued Quasi-Nonexpansive Mappings in Uniformly Convex Banach Spaces
Abstract and Applied Analysis Volume 2012, Article ID 435790, 6 pages doi:10.1155/2012/435790 Research Article Convergence Theorems for Infinite Family of Multivalued Quasi-Nonexpansive Mappings in Uniformly
More informationStrong Convergence Theorem of Split Equality Fixed Point for Nonexpansive Mappings in Banach Spaces
Applied Mathematical Sciences, Vol. 12, 2018, no. 16, 739-758 HIKARI Ltd www.m-hikari.com https://doi.org/10.12988/ams.2018.8580 Strong Convergence Theorem of Split Euality Fixed Point for Nonexpansive
More informationStrong convergence theorems for total quasi-ϕasymptotically
RESEARCH Open Access Strong convergence theorems for total quasi-ϕasymptotically nonexpansive multi-valued mappings in Banach spaces Jinfang Tang 1 and Shih-sen Chang 2* * Correspondence: changss@yahoo.
More informationResearch Article Iterative Approximation of Common Fixed Points of Two Nonself Asymptotically Nonexpansive Mappings
Discrete Dynamics in Nature and Society Volume 2011, Article ID 487864, 16 pages doi:10.1155/2011/487864 Research Article Iterative Approximation of Common Fixed Points of Two Nonself Asymptotically Nonexpansive
More informationResearch Article Existence and Duality of Generalized ε-vector Equilibrium Problems
Applied Mathematics Volume 2012, Article ID 674512, 13 pages doi:10.1155/2012/674512 Research Article Existence and Duality of Generalized ε-vector Equilibrium Problems Hong-Yong Fu, Bin Dan, and Xiang-Yu
More informationResearch Article Strong Convergence of Parallel Iterative Algorithm with Mean Errors for Two Finite Families of Ćirić Quasi-Contractive Operators
Abstract and Applied Analysis Volume 01, Article ID 66547, 10 pages doi:10.1155/01/66547 Research Article Strong Convergence of Parallel Iterative Algorithm with Mean Errors for Two Finite Families of
More informationSTRONG CONVERGENCE OF AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 45 (2009), 147 158 STRONG CONVERGENCE OF AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS Xiaolong Qin 1, Shin Min Kang 1, Yongfu Su 2,
More informationMonotone variational inequalities, generalized equilibrium problems and fixed point methods
Wang Fixed Point Theory and Applications 2014, 2014:236 R E S E A R C H Open Access Monotone variational inequalities, generalized equilibrium problems and fixed point methods Shenghua Wang * * Correspondence:
More informationResearch Article Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming
Discrete Dynamics in Nature and Society Volume 20, Article ID 7697, pages doi:0.55/20/7697 Research Article Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming Wei-Xiang
More informationResearch Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem
Journal of Applied Mathematics Volume 2012, Article ID 219478, 15 pages doi:10.1155/2012/219478 Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity
More informationResearch Article The Existence of Countably Many Positive Solutions for Nonlinear nth-order Three-Point Boundary Value Problems
Hindawi Publishing Corporation Boundary Value Problems Volume 9, Article ID 575, 8 pages doi:.55/9/575 Research Article The Existence of Countably Many Positive Solutions for Nonlinear nth-order Three-Point
More informationThe Split Common Fixed Point Problem for Directed Operators
The Split Common Fixed Point Problem for Directed Operators Yair Censor and Alexander Segal ({yair,asegal}@math.haifa.ac.il) Department of Mathematics, University of Haifa Mt. Carmel, Haifa 31905, Israel
More informationResearch Article Existence of Periodic Positive Solutions for Abstract Difference Equations
Discrete Dynamics in Nature and Society Volume 2011, Article ID 870164, 7 pages doi:10.1155/2011/870164 Research Article Existence of Periodic Positive Solutions for Abstract Difference Equations Shugui
More informationResearch Article Generalized Mann Iterations for Approximating Fixed Points of a Family of Hemicontractions
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 008, Article ID 84607, 9 pages doi:10.1155/008/84607 Research Article Generalized Mann Iterations for Approximating Fixed Points
More informationResearch Article Convergence Theorems for Common Fixed Points of Nonself Asymptotically Quasi-Non-Expansive Mappings
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2008, Article ID 428241, 11 pages doi:10.1155/2008/428241 Research Article Convergence Theorems for Common Fixed Points of Nonself
More informationLecture Notes on Iterative Optimization Algorithms
Charles L. Byrne Department of Mathematical Sciences University of Massachusetts Lowell December 8, 2014 Lecture Notes on Iterative Optimization Algorithms Contents Preface vii 1 Overview and Examples
More informationResearch Article Constrained Solutions of a System of Matrix Equations
Journal of Applied Mathematics Volume 2012, Article ID 471573, 19 pages doi:10.1155/2012/471573 Research Article Constrained Solutions of a System of Matrix Equations Qing-Wen Wang 1 and Juan Yu 1, 2 1
More informationResearch Article The Solution by Iteration of a Composed K-Positive Definite Operator Equation in a Banach Space
Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2010, Article ID 376852, 7 pages doi:10.1155/2010/376852 Research Article The Solution by Iteration
More informationThai Journal of Mathematics Volume 14 (2016) Number 1 : ISSN
Thai Journal of Mathematics Volume 14 (2016) Number 1 : 53 67 http://thaijmath.in.cmu.ac.th ISSN 1686-0209 A New General Iterative Methods for Solving the Equilibrium Problems, Variational Inequality Problems
More informationResearch Article Extended Precise Large Deviations of Random Sums in the Presence of END Structure and Consistent Variation
Applied Mathematics Volume 2012, Article ID 436531, 12 pages doi:10.1155/2012/436531 Research Article Extended Precise Large Deviations of Random Sums in the Presence of END Structure and Consistent Variation
More informationAuxiliary-Function Methods in Optimization
Auxiliary-Function Methods in Optimization Charles Byrne (Charles Byrne@uml.edu) http://faculty.uml.edu/cbyrne/cbyrne.html Department of Mathematical Sciences University of Massachusetts Lowell Lowell,
More informationIterative Convex Optimization Algorithms; Part Two: Without the Baillon Haddad Theorem
Iterative Convex Optimization Algorithms; Part Two: Without the Baillon Haddad Theorem Charles L. Byrne February 24, 2015 Abstract Let C X be a nonempty subset of an arbitrary set X and f : X R. The problem
More informationAuxiliary-Function Methods in Iterative Optimization
Auxiliary-Function Methods in Iterative Optimization Charles L. Byrne April 6, 2015 Abstract Let C X be a nonempty subset of an arbitrary set X and f : X R. The problem is to minimize f over C. In auxiliary-function
More informationResearch Article A New Roper-Suffridge Extension Operator on a Reinhardt Domain
Abstract and Applied Analysis Volume 2011, Article ID 865496, 14 pages doi:10.1155/2011/865496 Research Article A New Roper-Suffridge Extension Operator on a Reinhardt Domain Jianfei Wang and Cailing Gao
More informationResearch Article Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming
Applied Mathematics Volume 2012, Article ID 692325, 9 pages doi:10.1155/2012/692325 Research Article Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming Huijuan Xiong,
More informationA generalized forward-backward method for solving split equality quasi inclusion problems in Banach spaces
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 4890 4900 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa A generalized forward-backward
More informationA general iterative algorithm for equilibrium problems and strict pseudo-contractions in Hilbert spaces
A general iterative algorithm for equilibrium problems and strict pseudo-contractions in Hilbert spaces MING TIAN College of Science Civil Aviation University of China Tianjin 300300, China P. R. CHINA
More informationSequential Unconstrained Minimization: A Survey
Sequential Unconstrained Minimization: A Survey Charles L. Byrne February 21, 2013 Abstract The problem is to minimize a function f : X (, ], over a non-empty subset C of X, where X is an arbitrary set.
More informationResearch Article Attracting Periodic Cycles for an Optimal Fourth-Order Nonlinear Solver
Abstract and Applied Analysis Volume 01, Article ID 63893, 8 pages doi:10.1155/01/63893 Research Article Attracting Periodic Cycles for an Optimal Fourth-Order Nonlinear Solver Mi Young Lee and Changbum
More informationResearch Article Existence and Uniqueness of Homoclinic Solution for a Class of Nonlinear Second-Order Differential Equations
Applied Mathematics Volume 2012, Article ID 615303, 13 pages doi:10.1155/2012/615303 Research Article Existence and Uniqueness of Homoclinic Solution for a Class of Nonlinear Second-Order Differential
More informationResearch Article Fixed Point Theorems of Quasicontractions on Cone Metric Spaces with Banach Algebras
Abstract and Applied Analysis Volume 2013, Article ID 187348, 5 pages http://dx.doi.org/10.1155/2013/187348 Research Article Fixed Point Theorems of Quasicontractions on Cone Metric Spaces with Banach
More informationAn iterative method for fixed point problems and variational inequality problems
Mathematical Communications 12(2007), 121-132 121 An iterative method for fixed point problems and variational inequality problems Muhammad Aslam Noor, Yonghong Yao, Rudong Chen and Yeong-Cheng Liou Abstract.
More informationOn the Weak Convergence of the Extragradient Method for Solving Pseudo-Monotone Variational Inequalities
J Optim Theory Appl 208) 76:399 409 https://doi.org/0.007/s0957-07-24-0 On the Weak Convergence of the Extragradient Method for Solving Pseudo-Monotone Variational Inequalities Phan Tu Vuong Received:
More informationOn an iterative algorithm for variational inequalities in. Banach space
MATHEMATICAL COMMUNICATIONS 95 Math. Commun. 16(2011), 95 104. On an iterative algorithm for variational inequalities in Banach spaces Yonghong Yao 1, Muhammad Aslam Noor 2,, Khalida Inayat Noor 3 and
More informationThe Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive Mappings in Hilbert Spaces
Applied Mathematical Sciences, Vol. 11, 2017, no. 12, 549-560 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.718 The Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive
More informationResearch Article Some Results on Strictly Pseudocontractive Nonself-Mappings and Equilibrium Problems in Hilbert Spaces
Abstract and Applied Analysis Volume 2012, Article ID 543040, 14 pages doi:10.1155/2012/543040 Research Article Some Results on Strictly Pseudocontractive Nonself-Mappings and Equilibrium Problems in Hilbert
More informationON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction
J. Korean Math. Soc. 38 (2001), No. 3, pp. 683 695 ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE Sangho Kum and Gue Myung Lee Abstract. In this paper we are concerned with theoretical properties
More informationResearch Article Quasilinearization Technique for Φ-Laplacian Type Equations
International Mathematics and Mathematical Sciences Volume 0, Article ID 975760, pages doi:0.55/0/975760 Research Article Quasilinearization Technique for Φ-Laplacian Type Equations Inara Yermachenko and
More informationResearch Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations
Abstract and Applied Analysis Volume 212, Article ID 391918, 11 pages doi:1.1155/212/391918 Research Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations Chuanjun Chen
More informationResearch Article Remarks on Asymptotic Centers and Fixed Points
Abstract and Applied Analysis Volume 2010, Article ID 247402, 5 pages doi:10.1155/2010/247402 Research Article Remarks on Asymptotic Centers and Fixed Points A. Kaewkhao 1 and K. Sokhuma 2 1 Department
More informationResearch Article On the Convergence of Implicit Picard Iterative Sequences for Strongly Pseudocontractive Mappings in Banach Spaces
Applied Mathematics Volume 2013, Article ID 284937, 5 pages http://dx.doi.org/10.1155/2013/284937 Research Article On the Convergence of Implicit Picard Iterative Sequences for Strongly Pseudocontractive
More informationResearch Article Almost Sure Central Limit Theorem of Sample Quantiles
Advances in Decision Sciences Volume 202, Article ID 67942, 7 pages doi:0.55/202/67942 Research Article Almost Sure Central Limit Theorem of Sample Quantiles Yu Miao, Shoufang Xu, 2 and Ang Peng 3 College
More informationHybrid CQ projection algorithm with line-search process for the split feasibility problem
Dang et al. Journal of Inequalities and Applications 016 016:106 DOI 10.1186/s13660-016-1039-7 R E S E A R C H Open Access Hbrid CQ proection algorithm with line-search process for the split feasibilit
More informationExtensions of Korpelevich s Extragradient Method for the Variational Inequality Problem in Euclidean Space
Extensions of Korpelevich s Extragradient Method for the Variational Inequality Problem in Euclidean Space Yair Censor 1,AvivGibali 2 andsimeonreich 2 1 Department of Mathematics, University of Haifa,
More informationResearch Article A Characterization of E-Benson Proper Efficiency via Nonlinear Scalarization in Vector Optimization
Applied Mathematics, Article ID 649756, 5 pages http://dx.doi.org/10.1155/2014/649756 Research Article A Characterization of E-Benson Proper Efficiency via Nonlinear Scalarization in Vector Optimization
More informationResearch Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
Applied Mathematics Volume 202, Article ID 689820, 3 pages doi:0.55/202/689820 Research Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
More informationResearch Article Translative Packing of Unit Squares into Squares
International Mathematics and Mathematical Sciences Volume 01, Article ID 61301, 7 pages doi:10.1155/01/61301 Research Article Translative Packing of Unit Squares into Squares Janusz Januszewski Institute
More informationResearch Article A New Fractional Integral Inequality with Singularity and Its Application
Abstract and Applied Analysis Volume 212, Article ID 93798, 12 pages doi:1.1155/212/93798 Research Article A New Fractional Integral Inequality with Singularity and Its Application Qiong-Xiang Kong 1 and
More informationViscosity approximation methods for the implicit midpoint rule of asymptotically nonexpansive mappings in Hilbert spaces
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 016, 4478 4488 Research Article Viscosity approximation methods for the implicit midpoint rule of asymptotically nonexpansive mappings in Hilbert
More informationDepartment of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
Hindawi Publishing Corporation Abstract and Applied Analysis Volume 2009, Article ID 728510, 14 pages doi:10.1155/2009/728510 Research Article Common Fixed Points of Multistep Noor Iterations with Errors
More informationResearch Article The Dirichlet Problem on the Upper Half-Space
Abstract and Applied Analysis Volume 2012, Article ID 203096, 5 pages doi:10.1155/2012/203096 Research Article The Dirichlet Problem on the Upper Half-Space Jinjin Huang 1 and Lei Qiao 2 1 Department of
More informationResearch Article Exponential Inequalities for Positively Associated Random Variables and Applications
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 008, Article ID 38536, 11 pages doi:10.1155/008/38536 Research Article Exponential Inequalities for Positively Associated
More informationResearch Article Frequent Oscillatory Behavior of Delay Partial Difference Equations with Positive and Negative Coefficients
Hindawi Publishing Corporation Advances in Difference Equations Volume 2010, Article ID 606149, 15 pages doi:10.1155/2010/606149 Research Article Frequent Oscillatory Behavior of Delay Partial Difference
More informationResearch Article An Inverse Eigenvalue Problem for Jacobi Matrices
Mathematical Problems in Engineering Volume 2011 Article ID 571781 11 pages doi:10.1155/2011/571781 Research Article An Inverse Eigenvalue Problem for Jacobi Matrices Zhengsheng Wang 1 and Baoiang Zhong
More informationSTRONG CONVERGENCE OF APPROXIMATION FIXED POINTS FOR NONEXPANSIVE NONSELF-MAPPING
STRONG CONVERGENCE OF APPROXIMATION FIXED POINTS FOR NONEXPANSIVE NONSELF-MAPPING RUDONG CHEN AND ZHICHUAN ZHU Received 17 May 2006; Accepted 22 June 2006 Let C be a closed convex subset of a uniformly
More informationA double projection method for solving variational inequalities without monotonicity
A double projection method for solving variational inequalities without monotonicity Minglu Ye Yiran He Accepted by Computational Optimization and Applications, DOI: 10.1007/s10589-014-9659-7,Apr 05, 2014
More informationResearch Article Positive Solutions for Neumann Boundary Value Problems of Second-Order Impulsive Differential Equations in Banach Spaces
Abstract and Applied Analysis Volume 212, Article ID 41923, 14 pages doi:1.1155/212/41923 Research Article Positive Solutions for Neumann Boundary Value Problems of Second-Order Impulsive Differential
More informationA note on the unique solution of linear complementarity problem
COMPUTATIONAL SCIENCE SHORT COMMUNICATION A note on the unique solution of linear complementarity problem Cui-Xia Li 1 and Shi-Liang Wu 1 * Received: 13 June 2016 Accepted: 14 November 2016 First Published:
More informationAlternating Minimization and Alternating Projection Algorithms: A Tutorial
Alternating Minimization and Alternating Projection Algorithms: A Tutorial Charles L. Byrne Department of Mathematical Sciences University of Massachusetts Lowell Lowell, MA 01854 March 27, 2011 Abstract
More informationResearch Article Residual Iterative Method for Solving Absolute Value Equations
Abstract and Applied Analysis Volume 2012, Article ID 406232, 9 pages doi:10.1155/2012/406232 Research Article Residual Iterative Method for Solving Absolute Value Equations Muhammad Aslam Noor, 1 Javed
More informationResearch Article An Auxiliary Function Method for Global Minimization in Integer Programming
Mathematical Problems in Engineering Volume 2011, Article ID 402437, 13 pages doi:10.1155/2011/402437 Research Article An Auxiliary Function Method for Global Minimization in Integer Programming Hongwei
More informationResearch Article An iterative Algorithm for Hemicontractive Mappings in Banach Spaces
Abstract and Alied Analysis Volume 2012, Article ID 264103, 11 ages doi:10.1155/2012/264103 Research Article An iterative Algorithm for Hemicontractive Maings in Banach Saces Youli Yu, 1 Zhitao Wu, 2 and
More informationCONVERGENCE PROPERTIES OF COMBINED RELAXATION METHODS
CONVERGENCE PROPERTIES OF COMBINED RELAXATION METHODS Igor V. Konnov Department of Applied Mathematics, Kazan University Kazan 420008, Russia Preprint, March 2002 ISBN 951-42-6687-0 AMS classification:
More informationExistence of Solutions to Split Variational Inequality Problems and Split Minimization Problems in Banach Spaces
Existence of Solutions to Split Variational Inequality Problems and Split Minimization Problems in Banach Spaces Jinlu Li Department of Mathematical Sciences Shawnee State University Portsmouth, Ohio 45662
More informationResearch Article Finding Global Minima with a Filled Function Approach for Non-Smooth Global Optimization
Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 00, Article ID 843609, 0 pages doi:0.55/00/843609 Research Article Finding Global Minima with a Filled Function Approach for
More informationCONVERGENCE OF HYBRID FIXED POINT FOR A PAIR OF NONLINEAR MAPPINGS IN BANACH SPACES
International Journal of Analysis and Applications ISSN 2291-8639 Volume 8, Number 1 2015), 69-78 http://www.etamaths.com CONVERGENCE OF HYBRID FIXED POINT FOR A PAIR OF NONLINEAR MAPPINGS IN BANACH SPACES
More informationSplit hierarchical variational inequality problems and fixed point problems for nonexpansive mappings
Ansari et al. Journal of Inequalities and Applications (015) 015:74 DOI 10.1186/s13660-015-0793- R E S E A R C H Open Access Split hierarchical variational inequality problems and fixed point problems
More informationResearch Article The Zeros of Orthogonal Polynomials for Jacobi-Exponential Weights
bstract and pplied nalysis Volume 2012, rticle ID 386359, 17 pages doi:10.1155/2012/386359 Research rticle The Zeros of Orthogonal Polynomials for Jacobi-Exponential Weights Rong Liu and Ying Guang Shi
More informationSome unified algorithms for finding minimum norm fixed point of nonexpansive semigroups in Hilbert spaces
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 211, 331 346 Some unified algorithms for finding minimum norm fixed point of nonexpansive semigroups in Hilbert spaces Yonghong Yao, Yeong-Cheng Liou Abstract
More informationExistence and convergence theorems for the split quasi variational inequality problems on proximally smooth sets
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 (206), 2364 2375 Research Article Existence and convergence theorems for the split quasi variational inequality problems on proximally smooth
More informationFinite Convergence for Feasible Solution Sequence of Variational Inequality Problems
Mathematical and Computational Applications Article Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems Wenling Zhao *, Ruyu Wang and Hongxiang Zhang School of Science,
More informationResearch Article Modulus of Convexity, the Coeffcient R 1,X, and Normal Structure in Banach Spaces
Abstract and Applied Analysis Volume 2008, Article ID 135873, 5 pages doi:10.1155/2008/135873 Research Article Modulus of Convexity, the Coeffcient R 1,X, and Normal Structure in Banach Spaces Hongwei
More informationParallel Cimmino-type methods for ill-posed problems
Parallel Cimmino-type methods for ill-posed problems Cao Van Chung Seminar of Centro de Modelización Matemática Escuela Politécnica Naciónal Quito ModeMat, EPN, Quito Ecuador cao.vanchung@epn.edu.ec, cvanchung@gmail.com
More informationResearch Article Product of Extended Cesàro Operator and Composition Operator from Lipschitz Space to F p, q, s Space on the Unit Ball
Abstract and Applied Analysis Volume 2011, Article ID 152635, 9 pages doi:10.1155/2011/152635 Research Article Product of Extended Cesàro Operator and Composition Operator from Lipschitz Space to F p,
More informationResearch Article Fixed Point Theorems in Cone Banach Spaces
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2009, Article ID 609281, 9 pages doi:10.1155/2009/609281 Research Article Fixed Point Theorems in Cone Banach Spaces Erdal Karapınar
More information