• 제목/요약/키워드: maximal monotone mapping

검색결과 16건 처리시간 0.027초

MONOTONE CQ ALGORITHM FOR WEAK RELATIVELY NONEXPANSIVE MAPPINGS AND MAXIMAL MONOTONE OPERATORS IN BANACH SPACES

  • Kang, Jinlong;Su, Yongfu;Zhang, Xin
    • Journal of applied mathematics & informatics
    • /
    • 제29권1_2호
    • /
    • pp.293-309
    • /
    • 2011
  • The purpose of this article is to prove strong convergence theorems for weak relatively nonexpansive mapping which is firstly presented in this article. In order to get the strong convergence theorems for weak relatively nonexpansive mapping, the monotone CQ iteration method is presented and is used to approximate the fixed point of weak relatively nonexpansive mapping, therefore this article apply above results to prove the strong convergence theorems of zero point for maximal monotone operators in Banach spaces. Noting that, the CQ iteration method can be used for relatively nonexpansive mapping but it can not be used for weak relatively nonexpansive mapping. However, the monotone CQ method can be used for weak relatively nonexpansive mapping. The results of this paper modify and improve the results of S.Matsushita and W.Takahashi, and some others.

A MODIFIED PROXIMAL POINT ALGORITHM FOR SOLVING A CLASS OF VARIATIONAL INCLUSIONS IN BANACH SPACES

  • LIU, YING
    • Journal of applied mathematics & informatics
    • /
    • 제33권3_4호
    • /
    • pp.401-415
    • /
    • 2015
  • In this paper, we propose a modified proximal point algorithm which consists of a resolvent operator technique step followed by a generalized projection onto a moving half-space for approximating a solution of a variational inclusion involving a maximal monotone mapping and a monotone, bounded and continuous operator in Banach spaces. The weak convergence of the iterative sequence generated by the algorithm is also proved.

GENERAL ITERATIVE ALGORITHMS FOR MONOTONE INCLUSION, VARIATIONAL INEQUALITY AND FIXED POINT PROBLEMS

  • Jung, Jong Soo
    • 대한수학회지
    • /
    • 제58권3호
    • /
    • pp.525-552
    • /
    • 2021
  • In this paper, we introduce two general iterative algorithms (one implicit algorithm and one explicit algorithm) for finding a common element of the solution set of the variational inequality problems for a continuous monotone mapping, the zero point set of a set-valued maximal monotone operator, and the fixed point set of a continuous pseudocontractive mapping in a Hilbert space. Then we establish strong convergence of the proposed iterative algorithms to a common point of three sets, which is a solution of a certain variational inequality. Further, we find the minimum-norm element in common set of three sets.

GENERAL FRAMEWORK FOR PROXIMAL POINT ALGORITHMS ON (A, η)-MAXIMAL MONOTONICIT FOR NONLINEAR VARIATIONAL INCLUSIONS

  • Verma, Ram U.
    • 대한수학회논문집
    • /
    • 제26권4호
    • /
    • pp.685-693
    • /
    • 2011
  • General framework for proximal point algorithms based on the notion of (A, ${\eta}$)-maximal monotonicity (also referred to as (A, ${\eta}$)-monotonicity in literature) is developed. Linear convergence analysis for this class of algorithms to the context of solving a general class of nonlinear variational inclusion problems is successfully achieved along with some results on the generalized resolvent corresponding to (A, ${\eta}$)-monotonicity. The obtained results generalize and unify a wide range of investigations readily available in literature.

RELAXED PROXIMAL POINT ALGORITHMS BASED ON A-AXIMAL RELAXED MONOTONICITY FRAMEWORKS WITH APPLICATIONS

  • Agarwal, Ravi P.;Verma, Ram U.
    • East Asian mathematical journal
    • /
    • 제27권5호
    • /
    • pp.545-555
    • /
    • 2011
  • Based on the A-maximal(m)-relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak convergence using the relaxed proximal point algorithm to the context of the Douglas-Rachford splitting method, and Rockafellar (1976) on weak as well as strong convergence results on proximal point algorithms in real Hilbert space settings. Furthermore, the main result has been applied to the context of the H-maximal monotonicity frameworks for solving a general class of variational inclusion problems. It seems the obtained results can be used to generalize the Yosida approximation that, in turn, can be applied to first- order evolution inclusions, and can also be applied to Douglas-Rachford splitting methods for finding the zero of the sum of two A-maximal (m)-relaxed monotone mappings.

ON NONLINEAR VARIATIONAL INCLUSIONS WITH ($A,{\eta}$)-MONOTONE MAPPINGS

  • Hao, Yan
    • East Asian mathematical journal
    • /
    • 제25권2호
    • /
    • pp.159-169
    • /
    • 2009
  • In this paper, we introduce a generalized system of nonlinear relaxed co-coercive variational inclusions involving (A, ${\eta}$)-monotone map-pings in the framework of Hilbert spaces. Based on the generalized resol-vent operator technique associated with (A, ${\eta}$)-monotonicity, we consider the approximation solvability of solutions to the generalized system. Since (A, ${\eta}$)-monotonicity generalizes A-monotonicity and H-monotonicity, The results presented this paper improve and extend the corresponding results announced by many others.

PERTURBED PROXIMAL POINT ALGORITHMS FOR GENERALIZED MIXED VARIATIONAL INEQUALITIES

  • Jeong, Jae-Ug
    • East Asian mathematical journal
    • /
    • 제18권1호
    • /
    • pp.95-109
    • /
    • 2002
  • In this paper, we study a class of variational inequalities, which is called the generalized set-valued mixed variational inequality. By using the properties of the resolvent operator associated with a maximal monotone mapping in Hilbert spaces, we have established an existence theorem of solutions for generalized set-valued mixed variational inequalities, suggesting a new iterative algorithm and a perturbed proximal point algorithm for finding approximate solutions which strongly converge to the exact solution of the generalized set-valued mixed variational inequalities.

  • PDF

CONVERGENCE AND STABILITY OF THREE-STEP ITERATIVE SCHEME WITH ERRORS FOR COMPLETELY GENERALIZED STRONGLY NONLINEAR QUASIVARIATIONAL INEQUALITIES

  • ZHANG FENGRONG;GAO HAIYAN;LIU ZEQING;KANG SHIN MIN
    • Journal of applied mathematics & informatics
    • /
    • 제20권1_2호
    • /
    • pp.465-478
    • /
    • 2006
  • In this paper, we introduce a new class of completely generalized strongly nonlinear quasivariational inequalities and establish its equivalence with a class of fixed point problems by using the resolvent operator technique. Utilizing this equivalence, we develop a three-step iterative scheme with errors, obtain a few existence theorems of solutions for the completely generalized non-linear strongly quasivariational inequality involving relaxed monotone, relaxed Lipschitz, strongly monotone and generalized pseudocontractive mappings and prove some convergence and stability results of the sequence generated by the three-step iterative scheme with errors. Our results include several previously known results as special cases.

PROXIMAL POINT ALGORITHMS BASED ON THE (A, 𝜂)-MONOTONE MAPPINGS

  • Qin, Xiaolong;Shang, Meijuan;Yuan, Qing
    • 충청수학회지
    • /
    • 제21권2호
    • /
    • pp.147-155
    • /
    • 2008
  • In this paper, we consider proximal point algorithms based on ($A,{\eta}$)-monotone mappings in the framework of Hilbert spaces. Since ($A,{\eta}$)-monotone mappings generalize A-monotone mappings, H-monotone mappings and many other mappings, our results improve and extend the recent ones announced by [R.U. Verma, Rockafellars celebrated theorem based on A-maximal monotonicity design, Appl. Math. Lett. 21 (2008), 355-360] and [ R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim. 14 (1976) 877-898] and some others.

  • PDF