• Title/Summary/Keyword: monotone operator

Search Result 66, Processing Time 0.027 seconds

CONVERGENCE THEOREMS FOR TWO FAMILIES OF WEAK RELATIVELY NONEXPANSIVE MAPPINGS AND A FAMILY OF EQUILIBRIUM PROBLEMS

  • Zhang, Xin;Su, Yongfu
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.4
    • /
    • pp.583-607
    • /
    • 2010
  • The purpose of this paper is to prove strong convergence theorems for common fixed points of two families of weak relatively nonexpansive mappings and a family of equilibrium problems by a new monotone hybrid method in Banach spaces. Because the hybrid method presented in this paper is monotone, so that the method of the proof is different from the original one. We shall give an example which is weak relatively nonexpansive mapping but not relatively nonexpansive mapping in Banach space $l^2$. Our results improve and extend the corresponding results announced in [W. Takahashi and K. Zembayashi, Strong convergence theorem by a new hybrid method for equilibrium problems and relatively nonexpansive mappings, Fixed Point Theory Appl. (2008), Article ID 528476, 11 pages; doi:10.1155/2008/528476] and [Y. Su, Z. Wang, and H. Xu, Strong convergence theorems for a common fixed point of two hemi-relatively nonexpansive mappings, Nonlinear Anal. 71 (2009), no. 11, 5616?5628] and some other papers.

OUTER APPROXIMATION METHOD FOR ZEROS OF SUM OF MONOTONE OPERATORS AND FIXED POINT PROBLEMS IN BANACH SPACES

  • Abass, Hammad Anuoluwapo;Mebawondu, Akindele Adebayo;Narain, Ojen Kumar;Kim, Jong Kyu
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.3
    • /
    • pp.451-474
    • /
    • 2021
  • In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

A NEW RELAXED TSENG METHOD FOR FINDING A COMMON SOLUTION OF FIXED POINT AND SPLIT MONOTONE INCLUSION PROBLEMS

  • Lusanda Mzimela;Akindele Adebayo Mebawondu;Adhir Maharaj;Chinedu Izuchukwu;Ojen Kumar Narain
    • Nonlinear Functional Analysis and Applications
    • /
    • v.29 no.1
    • /
    • pp.225-258
    • /
    • 2024
  • In this paper, we study the problem of finding a common solution to a fixed point problem involving a finite family of ρ-demimetric operators and a split monotone inclusion problem with monotone and Lipschitz continuous operator in real Hilbert spaces. Motivated by the inertial technique and the Tseng method, a new and efficient iterative method for solving the aforementioned problem is introduced and studied. Also, we establish a strong convergence result of the proposed method under standard and mild conditions.

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

  • Verma, Ram U.
    • Communications of the Korean Mathematical Society
    • /
    • v.26 no.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.

PERTURBED PROXIMAL POINT ALGORITHMS FOR GENERALIZED MIXED VARIATIONAL INEQUALITIES

  • Jeong, Jae-Ug
    • East Asian mathematical journal
    • /
    • v.18 no.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

SQUARE QUADRATIC PROXIMAL METHOD FOR NONLINEAR COMPLIMENTARITY PROBLEMS

  • Bnouhachem, Abdellah;Ou-yassine, Ali
    • Communications of the Korean Mathematical Society
    • /
    • v.34 no.2
    • /
    • pp.671-684
    • /
    • 2019
  • In this paper, we propose a new interior point method for solving nonlinear complementarity problems. In this method, we use a new profitable searching direction and instead of using the logarithmic quadratic term, we use a square root quadratic term. We prove the global convergence of the proposed method under the assumption that F is monotone. Some preliminary computational results are given to illustrate the efficiency of the proposed method.

ITERATIVE ALGORITHMS WITH ERRORS FOR ZEROS OF ACCRETIVE OPERATORS IN BANACH SPACES

  • Jung, Jong-Soo
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.369-389
    • /
    • 2006
  • The iterative algorithms with errors for solutions to accretive operator inclusions are investigated in Banach spaces, including a modification of Rockafellar's proximal point algorithm. Some applications are given in Hilbert spaces. Our results improve the corresponding results in [1, 15-17, 29, 35].

UNIVARIATE LEFT FRACTIONAL POLYNOMIAL HIGH ORDER MONOTONE APPROXIMATION

  • Anastassiou, George A.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.2
    • /
    • pp.593-601
    • /
    • 2015
  • Let $f{\in}C^r$ ([-1,1]), $r{\geq}0$ and let $L^*$ be a linear left fractional differential operator such that $L^*$ $(f){\geq}0$ throughout [0, 1]. We can find a sequence of polynomials $Q_n$ of degree ${\leq}n$ such that $L^*$ $(Q_n){\geq}0$ over [0, 1], furthermore f is approximated left fractionally and simulta-neously by $Q_n$ on [-1, 1]. The degree of these restricted approximations is given via inequalities using a higher order modulus of smoothness for $f^{(r)}$.

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

  • Agarwal, Ravi P.;Verma, Ram U.
    • East Asian mathematical journal
    • /
    • v.27 no.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.