Abstract
Let E be a 2 uniformly smooth and convex real Banach space and let a mapping A: E → E∗ be lipschitz and strongly monotone such that A−1(0)≠∅. For an arbitrary ({x1}, {y1})∈E, we define the sequences {xn} and {yn} byyn = xn − θnJ−1(Axn), n≥1xn+1 = yn − λnJ−1(Ayn), n≥1where λn and θn are positive real number and J is the duality mapping of E. Letting (λn, θn)∈(0, 1), then xn and yn converges strongly to ρ∗, a unique solution of the equation Ax = 0. We also applied our algorithm in convex minimization and also proved the convergence of it in Lp, lp or Wm,p. At the end we proposed the algorithm of it in Lp(Ω) and its inverse Lq(Ω).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.