The convergence of Mann iteration with delay

Abstract

Authors

Stefan M. Soltuz
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy

Diana Otrocol

Diana Otrocol


Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy

Keywords

?

Paper coordinates

Ş.M. Şoltuz, D. Otrocol, The convergence of Mann iteration with delay, Mathematical Sciences Research, v. 11 (2007) no. 3, pp. 390-393

PDF

About this paper

Journal

Mathematical Sciences Research

Publisher Name

Global Publishing Company

DOI
Print ISSN

1537-5978

Online ISSN

google scholar link

??

Paper (preprint) in HTML form

2007-SoltuzOtrocol-MathSciRes-The convergence of Mann iteration with delay html,body { width: 100%; height: 100%; } *, *::before,*::after { box-sizing: border-box; } body { margin: 0; color: #1E2029; font-size: 14px; line-height: normal; } hr { box-sizing: content-box; height: 0; overflow: visible; } h1, h2, h3, h4, h5, h6 { margin-top: 0; margin-bottom: 0.5em; color: rgba(0, 0, 0, 0.85); font-weight: 500; } p { margin-top: 0; margin-bottom: 1em; } ol, ul, dl { margin-top: 0; margin-bottom: 1em; } ol ol, ul ul, ol ul, ul ol { margin-bottom: 0; } dt { font-weight: 500; } dd { margin-bottom: 0.5em; margin-left: 0; } blockquote { margin: 0 0 1em; } dfn { font-style: italic; } b, strong { font-weight: bolder; } small { font-size: 80%; } sub, sup { position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } sub { bottom: -0.25em; } sup { top: -0.5em; } a { color: #0B93ff; text-decoration: none; background-color: transparent; outline: none; cursor: pointer; transition: color 0.3s; } a:hover { color: #33aaff; } a:active { color: #0070d9; } a:active, a:hover { text-decoration: none; outline: 0; } a[disabled] { color: rgba(0, 0, 0, 0.25); cursor: not-allowed; pointer-events: none; } pre, code, kbd, samp { font-size: 1em; } pre { margin-top: 0; margin-bottom: 1em; overflow: auto; } figure { margin: 0 0 1em; } img { vertical-align: middle; border-style: none; } svg:not(:root) { overflow: hidden; } table { border-collapse: collapse; } caption { padding-top: 0.75em; padding-bottom: 0.3em; color: rgba(0, 0, 0, 0.45); text-align: left; caption-side: bottom; } th { text-align: inherit; } mjx-container[jax="SVG"] { direction: ltr; } mjx-container[jax="SVG"] > svg { overflow: visible; min-height: 1px; min-width: 1px; } mjx-container[jax="SVG"] > svg a { fill: blue; stroke: blue; } mjx-assistive-mml { position: absolute !important; top: 0px; left: 0px; clip: rect(1px, 1px, 1px, 1px); padding: 1px 0px 0px 0px !important; border: 0px !important; display: block !important; width: auto !important; overflow: hidden !important; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; -moz-user-select: none; -ms-user-select: none; user-select: none; } mjx-assistive-mml[display="block"] { width: 100% !important; } mjx-container[jax="SVG"][display="true"] { display: block; text-align: center; margin: 1em 0; } mjx-container[jax="SVG"][display="true"][width="full"] { display: flex; } mjx-container[jax="SVG"][justify="left"] { text-align: left; } mjx-container[jax="SVG"][justify="right"] { text-align: right; } g[data-mml-node="merror"] > g { fill: red; stroke: red; } g[data-mml-node="merror"] > rect[data-background] { fill: yellow; stroke: none; } g[data-mml-node="mtable"] > line[data-line], svg[data-table] > g > line[data-line] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > rect[data-frame], svg[data-table] > g > rect[data-frame] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > .mjx-dashed, svg[data-table] > g > .mjx-dashed { stroke-dasharray: 140; } g[data-mml-node="mtable"] > .mjx-dotted, svg[data-table] > g > .mjx-dotted { stroke-linecap: round; stroke-dasharray: 0,140; } g[data-mml-node="mtable"] > g > svg { overflow: visible; } [jax="SVG"] mjx-tool { display: inline-block; position: relative; width: 0; height: 0; } [jax="SVG"] mjx-tool > mjx-tip { position: absolute; top: 0; left: 0; } mjx-tool > mjx-tip { display: inline-block; padding: .2em; border: 1px solid #888; font-size: 70%; background-color: #F8F8F8; color: black; box-shadow: 2px 2px 5px #AAAAAA; } g[data-mml-node="maction"][data-toggle] { cursor: pointer; } mjx-status { display: block; position: fixed; left: 1em; bottom: 1em; min-width: 25%; padding: .2em .4em; border: 1px solid #888; font-size: 90%; background-color: #F8F8F8; color: black; } foreignObject[data-mjx-xml] { font-family: initial; line-height: normal; overflow: visible; } mjx-container[jax="SVG"] path[data-c], mjx-container[jax="SVG"] use[data-c] { stroke-width: 3; } #setText > div { justify-content: inherit; margin-top: 0; margin-bottom: 1em; } #setText div:last-child { margin-bottom: 0 !important; } #setText > br, #preview-content br { line-height: 1.2; } #preview-content > div { margin-top: 0; margin-bottom: 1em; } .proof > div, .theorem > div { margin-top: 1rem; } #preview-content table { margin-bottom: 1em; } #setText table { margin-bottom: 1em; } #preview-content .sub-table table, #setText .sub-table table { margin-bottom: 0; } mjx-container { text-indent: 0; overflow-y: hidden; overflow-x: auto; padding-top: 1px; padding-bottom: 1px; } .math-inline mjx-container { display: inline-block !important; page-break-inside: avoid; max-width: 100%; padding: 0; line-height: 0; } .math-inline[data-overflow="visible"] mjx-container { overflow: visible; } .math-inline mjx-container mjx-assistive-mml { max-width: 100%; } .math-block { align-items: center; page-break-after: auto; page-break-inside: avoid; margin: 0; display: block; /* mjx-container has block */ } .math-inline { display: inline-flex; /* mjx-container has inline-block. To prevent displacement during use overflow-x: auto;*/ max-width: 100%; } .math-block[data-width="full"] { overflow-x: auto; display: flex; /* mjx-container has flex */ } svg .math-inline { display: initial; max-width: initial; } svg .math-inline mjx-container { max-width: initial; } svg mjx-container { overflow: visible; padding: 0; } svg math-block[data-width="full"] { overflow: visible; } .math-block,.math-inline { --mmd-highlight-color: rgba(0, 147, 255, 0.25); --mmd-highlight-text-color: #1e2029; } .math-block[data-highlight-color] mjx-container[jax="SVG"] > svg { background-color: var(--mmd-highlight-color); } .math-block[data-highlight-text-color] mjx-container[jax="SVG"] > svg { color: var(--mmd-highlight-text-color); } .math-inline[data-highlight-color] mjx-container[jax="SVG"] { background-color: var(--mmd-highlight-color); } .math-inline[data-highlight-text-color] mjx-container[jax="SVG"] { color: var(--mmd-highlight-text-color); } .math-block p { flex-shrink: 1; } .math-block mjx-container { margin: 0 !important; } .math-error { background-color: yellow; color: red; } #preview-content img, #setText img { max-width: 100%; } #preview-content blockquote, #setText blockquote { page-break-inside: avoid; color: #666; margin: 0 0 1em 0; padding-left: 3em; border-left: .5em solid #eee; } #preview-content pre, #setText pre { border: none; padding: 0; overflow: auto; font-size: 85%; line-height: 1.45; border-radius: 6px; box-sizing: border-box; background: #f8f8fa; } #preview-content pre code, #setText pre code{ padding: 1rem; display: block; overflow-x: auto; line-height: 24px; } .empty { text-align: center; font-size: 18px; padding: 50px 0 !important; } #setText table, #preview-content table { display: table; overflow: auto; max-width: 100%; border-collapse: collapse; page-break-inside: avoid; } #setText table th, #preview-content table th { text-align: center; font-weight: bold; } #setText table td, #preview-content table td, #setText table th, #preview-content table th { border: 1px solid #dfe2e5; padding: 6px 13px; } #setText table tr, #preview-content table tr { background-color: #fff; border-top: 1px solid #c6cbd1; } #setText table tr:nth-child(2n), #preview-content table tr:nth-child(2n) { background-color: #f6f8fa; } #preview-content .main-title, #setText .main-title { text-align: center; line-height: 1.2; margin: 0 auto 1em auto; } #preview-content .author, #setText .author { text-align: center; margin: 0 auto; display: flex; justify-content: center; flex-wrap: wrap; } #preview-content .author p, #setText .author p { min-width: 30%; max-width: 50%; padding: 0 7px; } #preview-content .author > p > span, #setText .author > p > span { display: block; text-align: center; } #preview-content .section-title, #setText .section-title { margin-top: 1.5em; } #preview-content .abstract, #setText .abstract { text-align: justify; margin-bottom: 1em; } #preview-content .abstract p, #setText .abstract p { margin-bottom: 0; } @media print { #preview { font-size: 10pt!important; } svg { shape-rendering: crispEdges; } .math-block svg, math-inline svg { margin-top: 1px; } #preview-content img, #setText img { display: block; } #preview-content .figure_img img, #setText .figure_img img { display: inline; } .preview-right { word-break: break-word; } #preview-content h1, #setText h1 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h1::after, #setText h1::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h2, #setText h2 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h2::after, #setText h2::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h3, #setText h3 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h3::after, #setText h3::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h4, #setText h4 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h4::after, #setText h4::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h5, #setText h5 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h5::after, #setText h5::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h6, #setText h6 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h6::after, #setText h6::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } } #preview-content sup, #setText sup { top: -.5em; position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } #preview-content .text-url, #setText .text-url { color: #0B93ff; cursor: text; pointer-events: none; } #preview-content .text-url a:hover, #setText .text-url a:hover { color: #0B93ff; } mark { background-color: #feffe6; } span[data-underline-type] mark { background: inherit; background-color: #feffe6; padding-top: 0; padding-bottom: 0; } *[data-has-dotfill] { position: relative; overflow: hidden; } *[data-has-dotfill] .dotfill::after { position: absolute; padding-left: .25ch; content: " . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . "; text-align: right; } .smiles { text-align: center; } div.svg-container, #setText > div.svg-container { display: flex; justify-content: center; } #preview-content code, #setText code { font-family: Inconsolata; font-size: inherit; display: initial; background: #f8f8fa; } #preview-content .mmd-highlight code, #setText .mmd-highlight code, #preview-content pre.mmd-highlight code, #setText pre.mmd-highlight code { background-color: transparent; } #preview-content pre code, #setText pre code { font-family: 'DM Mono', Inconsolata, monospace; color: #333; font-size: 15px; } .hljs-comment, .hljs-quote { color: #998; font-style: italic; } .hljs-command { color: #005cc5; } .hljs-keyword, .hljs-selector-tag, .hljs-subst { color: #d73a49; font-weight: bold; } .hljs-number, .hljs-literal, .hljs-variable, .hljs-template-variable, .hljs-tag .hljs-attr { color: #005cc5; } .hljs-string, .hljs-doctag { color: #24292e; } .hljs-title, .hljs-section, .hljs-selector-id { color: #6f42c1; font-weight: bold; } .hljs-subst { font-weight: normal; } .hljs-type, .hljs-class .hljs-title { color: #458; font-weight: bold; } .hljs-tag, .hljs-name, .hljs-attribute { color: #000080; font-weight: normal; } .hljs-regexp, .hljs-link { color: #009926; } .hljs-symbol, .hljs-bullet { color: #990073; } .hljs-built_in, .hljs-builtin-name { color: #24292e; } .hljs-meta { color: #999; font-weight: bold; } .hljs-meta-keyword { color: #d73a49; } .hljs-meta-string { color: #032f62; } .hljs-deletion { background: #fdd; } .hljs-addition { background: #dfd; } .hljs-emphasis { font-style: italic; } .hljs-strong { font-weight: bold; } .table_tabular table th, .table_tabular table th { border: none !important; padding: 6px 13px; } .tabular tr, .tabular tr { border-top: none !important; border-bottom: none !important; } .tabular td, .tabular td { border-style: none !important; background-color: #fff; border-color: #000 !important; word-break: keep-all; padding: 0.1em 0.5em !important; } .tabular { display: inline-table !important; height: fit-content; } .tabular td > p { margin-bottom: 0; margin-top: 0; } .tabular td._empty { height: 1.3em; } .tabular td .f { opacity: 0; } html[data-theme="dark"] .tabular tr, html[data-theme="dark"] .tabular td { background-color: #202226; border-color: #fff !important; } .table_tabular { overflow-x: auto; padding: 0 2px 0.5em 2px; } .figure_img { margin-bottom: 0.5em; overflow-x: auto; } ol.enumerate, ul.itemize { padding-inline-start: 40px; } /* It's commented because counter not supporting to change value ol.enumerate.lower-alpha { counter-reset: item ; list-style-type: none !important; } .enumerate.lower-alpha > li { position: relative; } .enumerate.lower-alpha > li:before { content: "("counter(item, lower-alpha)")"; counter-increment: item; position: absolute; left: -47px; width: 47px; display: flex; justify-content: flex-end; padding-right: 7px; flex-wrap: nowrap; word-break: keep-all; } */ .itemize > li { position: relative; min-height: 1.4em; } .itemize > li > span.li_level, .li_enumerate.not_number > span.li_level { position: absolute; right: 100%; white-space: nowrap; width: max-content;; display: flex; justify-content: flex-end; padding-right: 10px; box-sizing: border-box; } .li_enumerate.not_number { position: relative; display: inline-block; list-style-type: none; min-height: 1.4em; } .itemize > li.li_itemize[data-marker-empty="true"]:not(.block), .enumerate > li.li_enumerate[data-marker-empty="true"]:not(.block) { text-indent: -20px; } .itemize > li.li_itemize.block[data-marker-empty="true"] > div:first-of-type, .enumerate > li.li_enumerate.block[data-marker-empty="true"] > div:first-of-type { text-indent: -20px; } .itemize > li.li_itemize.block[data-marker-empty="true"] > div:not(:first-of-type), .enumerate > li.li_enumerate.block[data-marker-empty="true"] > div:not(:first-of-type) { text-indent: 0; } .itemize > li.li_itemize.block[data-marker-empty="true"] > div:first-of-type *, .enumerate > li.li_enumerate.block[data-marker-empty="true"] > div:first-of-type * { text-indent: 0; } .itemize > li > span.li_level .math-inline, .enumerate > li > span.li_level .math-inline { display: inline-block; } #preview { font-family: 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; font-size: 17px; visibility: visible; word-break: break-word; padding: 2.5em; max-width: 800px; margin: auto; box-sizing: content-box; } #preview h1, #preview h2, #preview h3, #preview h4, #preview h5, #preview strong { font-family: 'CMU Serif Bold', 'Georgia', Helvetica, Arial, sans-serif; } #preview i, #preview em { font-family: 'CMU Serif Italic', 'Georgia', Helvetica, Arial, sans-serif; } .mmd-menu { max-width: 320px; position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #E5E6EB; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; } .mmd-menu:focus { outline: none; } .mmd-menu.mmd-menu-sm { max-width: 100vw; padding-bottom: 34px; border-radius: 0; -webkit-border-radius: 0; -moz-border-radius: 0; -khtml-border-radius: 0; } .mmd-menu-item-icon { color: #1e2029; margin-left: auto; align-items: center; display: flex; flex-shrink: 0; display: none; } .mmd-menu-item { padding-bottom: 8px; padding-top: 8px; padding-left: 1.25rem; padding-right: 1.25rem; display: flex; background: transparent; height: 52px; max-height: 52px; } .mmd-menu-item:focus { outline: none; } .mmd-menu-item.active { background-color: #e1e0e5; } .mmd-menu-item.active .mmd-menu-item-icon { display: flex; } .mmd-menu-item-container { overflow: hidden; } .mmd-menu-item-title { color: #1e2029; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 14px; line-height: 20px; } .mmd-menu-item-value { color: #7d829c; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 12px; line-height: 16px; } html[data-theme="dark"] .mmd-menu-item-title { color: #ebefe7; } html[data-theme="dark"] .mmd-menu-item.active .mmd-menu-item-title { color: #1e2029; } html[data-theme="dark"] .mmd-menu { background-color: #33363a; } .mmd-context-menu-overlay{ background: rgba(0, 0, 0, 0.56); } .ClipboardButton { padding: 0; margin: 0.5rem; display: inline-block; cursor: pointer; color: rgb(36, 41, 47); background: rgb(246, 248, 250); border-radius: 6px; border: 1px solid rgba(31, 35, 40, 0.15); box-shadow: rgba(31, 35, 40, 0.04) 0 1px 0 0, rgba(255, 255, 255, 0.25) 0 1px 0 0 inset; position: relative; } .ClipboardButton:hover { background-color: rgb(243, 244, 246); border-color: rgba(31, 35, 40, 0.15); transition-duration: .1s; } td .mmd-clipboard-copy-container { line-height: 0; } td .ClipboardButton { margin: 1px; line-height: 0; } td .ClipboardButton .mmd-clipboard-icon { margin: 1px !important; transform: scale(0.6); } .mmd-clipboard-icon { fill: currentColor; vertical-align: text-bottom; } .mmd-clipboard-copy-icon { color: rgb(101, 109, 118); } .mmd-clipboard-check-icon { color: rgb(26, 127, 55); } .mmd-tooltipped-no-delay:hover::before, .mmd-tooltipped-no-delay:hover::after { animation-delay: 0s; } .mmd-tooltipped:hover::before, .mmd-tooltipped:hover::after { display: inline-block; text-decoration: none; animation-name: tooltip-appear; animation-duration: .1s; animation-fill-mode: forwards; animation-timing-function: ease-in; animation-delay: .4s; } .mmd-tooltipped-w::before { top: 50%; bottom: 50%; left: -7px; margin-top: -6px; border-left-color: rgb(36, 41, 47); } .mmd-tooltipped::before { position: absolute; z-index: 1000001; display: none; width: 0; height: 0; color: rgb(36, 41, 47); pointer-events: none; content: ""; border: 6px solid transparent; opacity: 0; } .mmd-tooltipped-w::after { right: 100%; bottom: 50%; margin-right: 6px; transform: translateY(50%); } .mmd-tooltipped::after { position: absolute; z-index: 1000000; display: none; padding: 0.5em 0.75em; font: normal normal 11px/1.5 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; -webkit-font-smoothing: subpixel-antialiased; color: rgb(255, 255, 255); text-align: center; text-decoration: none; text-shadow: none; text-transform: none; letter-spacing: normal; word-wrap: break-word; white-space: pre; pointer-events: none; content: attr(aria-label); background: rgb(36, 41, 47); border-radius: 6px; opacity: 0; }

The convergence of Mann iteration with delay ŞTEFAN M. ŞOLTUZ and DIANA OTROCOL

Abstract

We show the convergence of Mann iteration with delay for various classes of non-Lipschitzian operators.

AMS Subject classification: 47 H 10 .
Key words: Mann iteration with delay, strongly pseudocontractive, strongly accretive map.

1 Introduction

Let X X XXX be a real Banach space, B B BBB be a nonempty, convex subset of X X XXX, and T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B be an operator. Let u 1 ∈ B u 1 ∈ B u_(1)in Bu_{1} \in Bu1∈B be given and s > 0 s > 0 s > 0s>0s>0 a fixed number. We consider the following iteration, to which we further refer as Mann iteration with delay, see [5]:
(1) u n + 1 = ( 1 − α n ) u n − s + α n T u n − s , (1) u n + 1 = 1 − α n u n − s + α n T u n − s , {:(1)u_(n+1)=(1-alpha_(n))u_(n-s)+alpha_(n)Tu_(n-s)",":}\begin{equation*} u_{n+1}=\left(1-\alpha_{n}\right) u_{n-s}+\alpha_{n} T u_{n-s}, \tag{1} \end{equation*}(1)un+1=(1−αn)un−s+αnTun−s,
the sequence { α n } ⊂ ( 0 , 1 ) α n ⊂ ( 0 , 1 ) {alpha_(n)}sub(0,1)\left\{\alpha_{n}\right\} \subset(0,1){αn}⊂(0,1) satisfies
(2) lim n → ∞ α n = 0 , ∑ n = 1 ∞ α n = ∞ . (2) lim n → ∞   α n = 0 , ∑ n = 1 ∞   α n = ∞ . {:(2)lim_(n rarr oo)alpha_(n)=0","sum_(n=1)^(oo)alpha_(n)=oo.:}\begin{equation*} \lim _{n \rightarrow \infty} \alpha_{n}=0, \sum_{n=1}^{\infty} \alpha_{n}=\infty . \tag{2} \end{equation*}(2)limn→∞αn=0,∑n=1∞αn=∞.
We are inspired for such delays from economics and biology problems in which fixed point are required. Usually, T T TTT is a contraction. It is wellknown that Mann iteration is desirable when T T TTT is not a contraction.
The operator J : X → 2 X ∗ J : X → 2 X ∗ J:X rarr2^(X^(**))J: X \rightarrow 2^{X^{*}}J:X→2X∗ given by J x := { f ∈ X ∗ : ⟨ x , f ⟩ = ‖ x ‖ 2 , ‖ f ‖ = ‖ x ‖ } , ∀ x ∈ X J x := f ∈ X ∗ : ⟨ x , f ⟩ = ‖ x ‖ 2 , ‖ f ‖ = ‖ x ‖ } , ∀ x ∈ X Jx:={f inX^(**):(:x,f:)=||x||^(2),||f||=:}||x||},AA x in XJ x:=\left\{f \in X^{*}:\langle x, f\rangle=\|x\|^{2},\|f\|=\right. \|x\|\}, \forall x \in XJx:={f∈X∗:⟨x,f⟩=‖x‖2,‖f‖=‖x‖},∀x∈X, is called the normalized duality mapping. The Hahn-Banach theorem assures that J x ≠ ∅ , ∀ x ∈ X J x ≠ ∅ , ∀ x ∈ X Jx!=O/,AA x in XJ x \neq \emptyset, \forall x \in XJx≠∅,∀x∈X. It is easy to see that we have ⟨ j ( x ) , y ⟩ ≤ ‖ x ‖ ‖ y ‖ , ∀ x , y ∈ X , ∀ j ( x ) ∈ J ( x ) ⟨ j ( x ) , y ⟩ ≤ ‖ x ‖ ‖ y ‖ , ∀ x , y ∈ X , ∀ j ( x ) ∈ J ( x ) (:j(x),y:) <= ||x||||y||,AA x,y in X,AA j(x)in J(x)\langle j(x), y\rangle \leq \|x\|\|y\|, \forall x, y \in X, \forall j(x) \in J(x)⟨j(x),y⟩≤‖x‖‖y‖,∀x,y∈X,∀j(x)∈J(x).
Definition 1 Let X X XXX be a real Banach space. Let B B BBB be a nonempty subset. A A AAA map T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B is called strongly pseudocontractive if there exists k ∈ ( 0 , 1 ) k ∈ ( 0 , 1 ) k in(0,1)k \in(0,1)k∈(0,1) and a j ( x − y ) ∈ J ( x − y ) j ( x − y ) ∈ J ( x − y ) j(x-y)in J(x-y)j(x-y) \in J(x-y)j(x−y)∈J(x−y) such that
(3) ⟨ T x − T y , j ( x − y ) ⟩ ≤ ( 1 − k ) ‖ x − y ‖ 2 , ∀ x , y ∈ B . (3) ⟨ T x − T y , j ( x − y ) ⟩ ≤ ( 1 − k ) ‖ x − y ‖ 2 , ∀ x , y ∈ B . {:(3)(:Tx-Ty","j(x-y):) <= (1-k)||x-y||^(2)","AA x","y in B.:}\begin{equation*} \langle T x-T y, j(x-y)\rangle \leq(1-k)\|x-y\|^{2}, \forall x, y \in B . \tag{3} \end{equation*}(3)⟨Tx−Ty,j(x−y)⟩≤(1−k)‖x−y‖2,∀x,y∈B.
A map S : B → B S : B → B S:B rarr BS: B \rightarrow BS:B→B is called strongly accretive if there exists k ∈ ( 0 , 1 ) k ∈ ( 0 , 1 ) k in(0,1)k \in(0,1)k∈(0,1) and a j ( x − y ) ∈ J ( x − y ) j ( x − y ) ∈ J ( x − y ) j(x-y)in J(x-y)j(x-y) \in J(x-y)j(x−y)∈J(x−y) such that
(4) ⟨ S x − S y , j ( x − y ) ⟩ ≥ k ‖ x − y ‖ 2 , ∀ x , y ∈ B . (4) ⟨ S x − S y , j ( x − y ) ⟩ ≥ k ‖ x − y ‖ 2 , ∀ x , y ∈ B . {:(4)(:Sx-Sy","j(x-y):) >= k||x-y||^(2)","AA x","y in B.:}\begin{equation*} \langle S x-S y, j(x-y)\rangle \geq k\|x-y\|^{2}, \forall x, y \in B . \tag{4} \end{equation*}(4)⟨Sx−Sy,j(x−y)⟩≥k‖x−y‖2,∀x,y∈B.
In (3) when k = 1 k = 1 k=1k=1k=1, then T T TTT is called pseudocontractive. In (4) when k = 0 k = 0 k=0k=0k=0, then S S SSS is called accretive. Let us denote by I I III the identity map.
Lemma 2 If X X XXX is a real Banach space, then the following relation is true
(5) ‖ x + y ‖ 2 ≤ ‖ x ‖ 2 + 2 ⟨ y , j ( x + y ) ⟩ , ∀ x , y ∈ X , ∀ j ( x + y ) ∈ J ( x + y ) . (5) ‖ x + y ‖ 2 ≤ ‖ x ‖ 2 + 2 ⟨ y , j ( x + y ) ⟩ , ∀ x , y ∈ X , ∀ j ( x + y ) ∈ J ( x + y ) . {:(5)||x+y||^(2) <= ||x||^(2)+2(:y","j(x+y):)","AA x","y in X","AA j(x+y)in J(x+y).:}\begin{equation*} \|x+y\|^{2} \leq\|x\|^{2}+2\langle y, j(x+y)\rangle, \forall x, y \in X, \forall j(x+y) \in J(x+y) . \tag{5} \end{equation*}(5)‖x+y‖2≤‖x‖2+2⟨y,j(x+y)⟩,∀x,y∈X,∀j(x+y)∈J(x+y).
Lemma 3 [6] Let ( ρ n ) n ρ n n (rho_(n))_(n)\left(\rho_{n}\right)_{n}(ρn)n be a nonnegative sequence which satisfies the following inequality
(6) ρ n + 1 ≤ ( 1 − λ n ) ρ n + ε n (6) ρ n + 1 ≤ 1 − λ n ρ n + ε n {:(6)rho_(n+1) <= (1-lambda_(n))rho_(n)+epsi_(n):}\begin{equation*} \rho_{n+1} \leq\left(1-\lambda_{n}\right) \rho_{n}+\varepsilon_{n} \tag{6} \end{equation*}(6)ρn+1≤(1−λn)ρn+εn
where λ n ∈ ( 0 , 1 ) , ∀ n ∈ N , ∑ n = 1 ∞ λ n = ∞ λ n ∈ ( 0 , 1 ) , ∀ n ∈ N , ∑ n = 1 ∞ &hairsp; λ n = ∞ lambda_(n)in(0,1),AA n inN,sum_(n=1)^(oo)lambda_(n)=oo\lambda_{n} \in(0,1), \forall n \in \mathbb{N}, \sum_{n=1}^{\infty} \lambda_{n}=\inftyλn∈(0,1),∀n∈N,∑n=1∞λn=∞, and ε n = o ( λ n ) ε n = o λ n epsi_(n)=o(lambda_(n))\varepsilon_{n}=o\left(\lambda_{n}\right)εn=o(λn). Then lim n → ∞ ρ n = 0 lim n → ∞ &hairsp; ρ n = 0 lim_(n rarr oo)rho_(n)=0\lim _{n \rightarrow \infty} \rho_{n}=0limn→∞ρn=0.
Lemma 4 Let s ≥ 0 s ≥ 0 s >= 0s \geq 0s≥0 be a fixed number, { a n } a n {a_(n)}\left\{a_{n}\right\}{an} a nonnegative sequence which satisfies the following inequality
(6) a n + 1 ≤ ( 1 − α n ) a n − s + σ n (6) a n + 1 ≤ 1 − α n a n − s + σ n {:(6)a_(n+1) <= (1-alpha_(n))a_(n-s)+sigma_(n):}\begin{equation*} a_{n+1} \leq\left(1-\alpha_{n}\right) a_{n-s}+\sigma_{n} \tag{6} \end{equation*}(6)an+1≤(1−αn)an−s+σn
where α n ∈ ( 0 , 1 ) , ∀ n ∈ N , ∑ n = 1 ∞ α n = ∞ α n ∈ ( 0 , 1 ) , ∀ n ∈ N , ∑ n = 1 ∞ &hairsp; α n = ∞ alpha_(n)in(0,1),AA n inN,sum_(n=1)^(oo)alpha_(n)=oo\alpha_{n} \in(0,1), \forall n \in \mathbb{N}, \sum_{n=1}^{\infty} \alpha_{n}=\inftyαn∈(0,1),∀n∈N,∑n=1∞αn=∞, and σ n = o ( α n ) σ n = o α n sigma_(n)=o(alpha_(n))\sigma_{n}=o\left(\alpha_{n}\right)σn=o(αn). Then lim n → ∞ a n = 0 lim n → ∞ &hairsp; a n = 0 lim_(n rarr oo)a_(n)=0\lim _{n \rightarrow \infty} a_{n}=0limn→∞an=0.
Proof. Note that sequence { a n } a n {a_(n)}\left\{a_{n}\right\}{an} is the reunion of s + 1 s + 1 s+1s+1s+1 independent subsequences. If all such subsequences converges to zero then { a n } a n {a_(n)}\left\{a_{n}\right\}{an} shall converge. The generic subsequence satisfies (6). Set ρ n := a n − s , λ n := α n , ε n := σ n ρ n := a n − s , λ n := α n , ε n := σ n rho_(n):=a_(n-s),lambda_(n):=alpha_(n),epsi_(n):=sigma_(n)\rho_{n}:=a_{n-s}, \lambda_{n}:=\alpha_{n}, \varepsilon_{n}:=\sigma_{n}ρn:=an−s,λn:=αn,εn:=σn, and use Lemma 3 to obtain lim n → ∞ a n = 0 lim n → ∞ &hairsp; a n = 0 lim_(n rarr oo)a_(n)=0\lim _{n \rightarrow \infty} a_{n}=0limn→∞an=0.

2 Main result

Theorem 5 Let s ≥ 0 s ≥ 0 s >= 0s \geq 0s≥0 be a fixed number, X X XXX a real Banach space with a uniformly convex dual X ∗ , B X ∗ , B X^(**),BX^{*}, BX∗,B a nonempty closed convex bounded subset of X X XXX, and T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B be a continuous strongly pseudocontractive mapping. Then the Mann iteration with delay { x n } n = 1 ∞ x n n = 1 ∞ {x_(n)}_(n=1)^(oo)\left\{x_{n}\right\}_{n=1}^{\infty}{xn}n=1∞ defined by (1) converges strongly to the unique fixed point of T T TTT.
Proof. Corollary 1 of [2] assures the existence of a fixed point. The uniqueness of the fixed point comes from (3). Because X ∗ X ∗ X^(**)X^{*}X∗ is uniformly convex the duality map is singled valued (see, e.g., [1]). Let x ∗ x ∗ x^(**)x^{*}x∗ be the fixed point of T T TTT. Using (1), (3) and Lemma 2 we get
‖ u n + 1 − x ∗ ‖ 2 = ‖ ( 1 − α n ) ( u n − s − x ∗ ) + α n ( T u n − s − T x ∗ ) ‖ 2 ≤ ( 1 − α n ) 2 ‖ u n − s − x ∗ ‖ 2 + 2 α n ⟨ T u n − s − T x ∗ , J ( u n + 1 − x ∗ ) ⟩ = ( 1 − α n ) 2 ‖ u n − s − x ∗ ‖ 2 + 2 α n ⟨ T u n − s − T x ∗ , J ( u n − s − x ∗ ) ⟩ + + 2 α n ⟨ T u n − s − T x ∗ , J ( u n + 1 − x ∗ ) − J ( u n − s − x ∗ ) ⟩ ≤ ( 1 − α n ) 2 ‖ u n − s − x ∗ ‖ 2 + 2 α n ( 1 − k ) ‖ u n − s − x ∗ ‖ 2 + 2 α n σ n u n + 1 − x ∗ 2 = 1 − α n u n − s − x ∗ + α n T u n − s − T x ∗ 2 ≤ 1 − α n 2 u n − s − x ∗ 2 + 2 α n T u n − s − T x ∗ , J u n + 1 − x ∗ = 1 − α n 2 u n − s − x ∗ 2 + 2 α n T u n − s − T x ∗ , J u n − s − x ∗ + + 2 α n T u n − s − T x ∗ , J u n + 1 − x ∗ − J u n − s − x ∗ ≤ 1 − α n 2 u n − s − x ∗ 2 + 2 α n ( 1 − k ) u n − s − x ∗ 2 + 2 α n σ n {:[||u_(n+1)-x^(**)||^(2)=||(1-alpha_(n))(u_(n-s)-x^(**))+alpha_(n)(Tu_(n-s)-Tx^(**))||^(2)],[ <= (1-alpha_(n))^(2)||u_(n-s)-x^(**)||^(2)+2alpha_(n)(:Tu_(n-s)-Tx^(**),J(u_(n+1)-x^(**)):)],[=(1-alpha_(n))^(2)||u_(n-s)-x^(**)||^(2)+2alpha_(n)(:Tu_(n-s)-Tx^(**),J(u_(n-s)-x^(**)):)+],[+2alpha_(n)(:Tu_(n-s)-Tx^(**),J(u_(n+1)-x^(**))-J(u_(n-s)-x^(**)):)],[ <= (1-alpha_(n))^(2)||u_(n-s)-x^(**)||^(2)+2alpha_(n)(1-k)||u_(n-s)-x^(**)||^(2)+2alpha_(n)sigma_(n)]:}\begin{aligned} \left\|u_{n+1}-x^{*}\right\|^{2} & =\left\|\left(1-\alpha_{n}\right)\left(u_{n-s}-x^{*}\right)+\alpha_{n}\left(T u_{n-s}-T x^{*}\right)\right\|^{2} \\ & \leq\left(1-\alpha_{n}\right)^{2}\left\|u_{n-s}-x^{*}\right\|^{2}+2 \alpha_{n}\left\langle T u_{n-s}-T x^{*}, J\left(u_{n+1}-x^{*}\right)\right\rangle \\ & =\left(1-\alpha_{n}\right)^{2}\left\|u_{n-s}-x^{*}\right\|^{2}+2 \alpha_{n}\left\langle T u_{n-s}-T x^{*}, J\left(u_{n-s}-x^{*}\right)\right\rangle+ \\ & +2 \alpha_{n}\left\langle T u_{n-s}-T x^{*}, J\left(u_{n+1}-x^{*}\right)-J\left(u_{n-s}-x^{*}\right)\right\rangle \\ & \leq\left(1-\alpha_{n}\right)^{2}\left\|u_{n-s}-x^{*}\right\|^{2}+2 \alpha_{n}(1-k)\left\|u_{n-s}-x^{*}\right\|^{2}+2 \alpha_{n} \sigma_{n} \end{aligned}‖un+1−x∗‖2=‖(1−αn)(un−s−x∗)+αn(Tun−s−Tx∗)‖2≤(1−αn)2‖un−s−x∗‖2+2αn⟨Tun−s−Tx∗,J(un+1−x∗)⟩=(1−αn)2‖un−s−x∗‖2+2αn⟨Tun−s−Tx∗,J(un−s−x∗)⟩++2αn⟨Tun−s−Tx∗,J(un+1−x∗)−J(un−s−x∗)⟩≤(1−αn)2‖un−s−x∗‖2+2αn(1−k)‖un−s−x∗‖2+2αnσn
where
σ n = ⟨ T u n − s − T x ∗ , J ( u n + 1 − x ∗ ) − J ( u n − s − x ∗ ) ⟩ . σ n = T u n − s − T x ∗ , J u n + 1 − x ∗ − J u n − s − x ∗ . sigma_(n)=(:Tu_(n-s)-Tx^(**),J(u_(n+1)-x^(**))-J(u_(n-s)-x^(**)):).\sigma_{n}=\left\langle T u_{n-s}-T x^{*}, J\left(u_{n+1}-x^{*}\right)-J\left(u_{n-s}-x^{*}\right)\right\rangle .σn=⟨Tun−s−Tx∗,J(un+1−x∗)−J(un−s−x∗)⟩.
Now we shall show σ n → 0 σ n → 0 sigma_(n)rarr0\sigma_{n} \rightarrow 0σn→0 as n → ∞ n → ∞ n rarr oon \rightarrow \inftyn→∞. Observe that ( ‖ T u n − s − T x ∗ ‖ ) n T u n − s − T x ∗ n (||Tu_(n-s)-Tx^(**)||)_(n)\left(\left\|T u_{n-s}-T x^{*}\right\|\right)_{n}(‖Tun−s−Tx∗‖)n is bounded. We prove now that
(7) J ( u n + 1 − x ∗ ) − J ( u n − s − x ∗ ) → 0 as n → ∞ (7) J u n + 1 − x ∗ − J u n − s − x ∗ → 0  as  n → ∞ {:(7)J(u_(n+1)-x^(**))-J(u_(n-s)-x^(**))rarr0" as "n rarr oo:}\begin{equation*} J\left(u_{n+1}-x^{*}\right)-J\left(u_{n-s}-x^{*}\right) \rightarrow 0 \text { as } n \rightarrow \infty \tag{7} \end{equation*}(7)J(un+1−x∗)−J(un−s−x∗)→0 as n→∞
Proposition 12.3 on page 115, of [2] assures that, when X ∗ X ∗ X^(**)X^{*}X∗ is uniformly convex, then J J JJJ is uniformly continuous on every bounded set of X X XXX. To prove (7) it is sufficient to see that
‖ u n + 1 − u n − s ‖ = α n ‖ u n − s − T u n − s ‖ ≤ α n ( ‖ u n − s ‖ + ‖ T u n − s ‖ ) ≤ 2 α n M → 0 u n + 1 − u n − s = α n u n − s − T u n − s ≤ α n u n − s + T u n − s ≤ 2 α n M → 0 ||u_(n+1)-u_(n-s)||=alpha_(n)||u_(n-s)-Tu_(n-s)|| <= alpha_(n)(||u_(n-s)||+||Tu_(n-s)||) <= 2alpha_(n)M rarr0\left\|u_{n+1}-u_{n-s}\right\|=\alpha_{n}\left\|u_{n-s}-T u_{n-s}\right\| \leq \alpha_{n}\left(\left\|u_{n-s}\right\|+\left\|T u_{n-s}\right\|\right) \leq 2 \alpha_{n} M \rightarrow 0‖un+1−un−s‖=αn‖un−s−Tun−s‖≤αn(‖un−s‖+‖Tun−s‖)≤2αnM→0
where M = sup { ‖ u n − s ‖ , ‖ T u n − s ‖ } M = sup u n − s , T u n − s M=s u p{||u_(n-s)||,||Tu_(n-s)||}M=\sup \left\{\left\|u_{n-s}\right\|,\left\|T u_{n-s}\right\|\right\}M=sup{‖un−s‖,‖Tun−s‖}. The sequences ( u n − s ) n , ( T u n − s ) n u n − s n , T u n − s n (u_(n-s))_(n),(Tu_(n-s))_(n)\left(u_{n-s}\right)_{n},\left(T u_{n-s}\right)_{n}(un−s)n,(Tun−s)n are bounded being in the bounded set B B BBB. Hence (7) holds. Then
(8) ‖ u n + 1 − x ∗ ‖ 2 ≤ ( ( 1 − α n ) 2 + 2 α n ( 1 − k ) ) ‖ u n − s − x ∗ ‖ 2 + 2 α n σ n = ( 1 − 2 α n + α n 2 + 2 α n − 2 α n k ) ‖ u n − s − x ∗ ‖ 2 + 2 α n σ n = ( 1 + α n 2 − 2 α n k ) ‖ u n − s − x ∗ ‖ 2 + 2 α n σ n (8) u n + 1 − x ∗ 2 ≤ 1 − α n 2 + 2 α n ( 1 − k ) u n − s − x ∗ 2 + 2 α n σ n = 1 − 2 α n + α n 2 + 2 α n − 2 α n k u n − s − x ∗ 2 + 2 α n σ n = 1 + α n 2 − 2 α n k u n − s − x ∗ 2 + 2 α n σ n {:[(8)||u_(n+1)-x^(**)||^(2) <= ((1-alpha_(n))^(2)+2alpha_(n)(1-k))||u_(n-s)-x^(**)||^(2)+2alpha_(n)sigma_(n)],[=(1-2alpha_(n)+alpha_(n)^(2)+2alpha_(n)-2alpha_(n)k)||u_(n-s)-x^(**)||^(2)+2alpha_(n)sigma_(n)],[=(1+alpha_(n)^(2)-2alpha_(n)k)||u_(n-s)-x^(**)||^(2)+2alpha_(n)sigma_(n)]:}\begin{align*} \left\|u_{n+1}-x^{*}\right\|^{2} & \leq\left(\left(1-\alpha_{n}\right)^{2}+2 \alpha_{n}(1-k)\right)\left\|u_{n-s}-x^{*}\right\|^{2}+2 \alpha_{n} \sigma_{n} \tag{8}\\ & =\left(1-2 \alpha_{n}+\alpha_{n}^{2}+2 \alpha_{n}-2 \alpha_{n} k\right)\left\|u_{n-s}-x^{*}\right\|^{2}+2 \alpha_{n} \sigma_{n} \\ & =\left(1+\alpha_{n}^{2}-2 \alpha_{n} k\right)\left\|u_{n-s}-x^{*}\right\|^{2}+2 \alpha_{n} \sigma_{n} \end{align*}(8)‖un+1−x∗‖2≤((1−αn)2+2αn(1−k))‖un−s−x∗‖2+2αnσn=(1−2αn+αn2+2αn−2αnk)‖un−s−x∗‖2+2αnσn=(1+αn2−2αnk)‖un−s−x∗‖2+2αnσn
The condition lim n → ∞ α n = 0 lim n → ∞ &hairsp; α n = 0 lim_(n rarr oo)alpha_(n)=0\lim _{n \rightarrow \infty} \alpha_{n}=0limn→∞αn=0 implies the existence of an n 0 n 0 n_(0)n_{0}n0 such that for all n ≥ n 0 n ≥ n 0 n >= n_(0)n \geq n_{0}n≥n0 we have
(9) α n < k (9) α n < k {:(9)alpha_(n) < k:}\begin{equation*} \alpha_{n}<k \tag{9} \end{equation*}(9)αn<k
Substituting (9) into (8) we get 1 + α n 2 − 2 α n k < 1 − α n k 1 + α n 2 − 2 α n k < 1 − α n k 1+alpha_(n)^(2)-2alpha_(n)k < 1-alpha_(n)k1+\alpha_{n}^{2}-2 \alpha_{n} k<1-\alpha_{n} k1+αn2−2αnk<1−αnk. Finally, the above inequality yields
‖ u n + 1 − x ∗ ‖ 2 ≤ ( 1 − α n k ) ‖ u n − s − x ∗ ‖ 2 + 2 α n σ n u n + 1 − x ∗ 2 ≤ 1 − α n k u n − s − x ∗ 2 + 2 α n σ n ||u_(n+1)-x^(**)||^(2) <= (1-alpha_(n)k)||u_(n-s)-x^(**)||^(2)+2alpha_(n)sigma_(n)\left\|u_{n+1}-x^{*}\right\|^{2} \leq\left(1-\alpha_{n} k\right)\left\|u_{n-s}-x^{*}\right\|^{2}+2 \alpha_{n} \sigma_{n}‖un+1−x∗‖2≤(1−αnk)‖un−s−x∗‖2+2αnσn
Setting a n = ‖ u n − s − x ∗ ‖ 2 , λ n = α n k ∈ ( 0 , 1 ) a n = u n − s − x ∗ 2 , λ n = α n k ∈ ( 0 , 1 ) a_(n)=||u_(n-s)-x^(**)||^(2),lambda_(n)=alpha_(n)k in(0,1)a_{n}=\left\|u_{n-s}-x^{*}\right\|^{2}, \lambda_{n}=\alpha_{n} k \in(0,1)an=‖un−s−x∗‖2,λn=αnk∈(0,1), and using Lemma 4, we obtain lim n → ∞ a n = lim n → ∞ ‖ u n − s − x ∗ ‖ 2 = 0 lim n → ∞ &hairsp; a n = lim n → ∞ &hairsp; u n − s − x ∗ 2 = 0 lim_(n rarr oo)a_(n)=lim_(n rarr oo)||u_(n-s)-x^(**)||^(2)=0\lim _{n \rightarrow \infty} a_{n}=\lim _{n \rightarrow \infty}\left\|u_{n-s}-x^{*}\right\|^{2}=0limn→∞an=limn→∞‖un−s−x∗‖2=0 i.e.
lim n → ∞ ‖ u n − s − x ∗ ‖ = 0 lim n → ∞ &hairsp; u n − s − x ∗ = 0 lim_(n rarr oo)||u_(n-s)-x^(**)||=0\lim _{n \rightarrow \infty}\left\|u_{n-s}-x^{*}\right\|=0limn→∞‖un−s−x∗‖=0

3 The accretive and strongly accretive cases

Let I I III denote the identity map.
Remark 6 The operator T T TTT is a (strongly) pseudocontractive map if and only if ( I − T ) ( I − T ) (I-T)(I-T)(I−T) is a (strongly) accretive map.

Remark 7

  1. Let T , S : X → X T , S : X → X T,S:X rarr XT, S: X \rightarrow XT,S:X→X, and f ∈ X f ∈ X f in Xf \in Xf∈X be given. A fixed point for the map T x = f + ( I − S ) x , ∀ x ∈ X T x = f + ( I − S ) x , ∀ x ∈ X Tx=f+(I-S)x,AA x in XT x=f+(I-S) x, \forall x \in XTx=f+(I−S)x,∀x∈X is a solution for S x = f S x = f Sx=fS x=fSx=f.
  2. Let f ∈ X f ∈ X f in Xf \in Xf∈X be a given point. If S S SSS is an accretive map then T = f − S T = f − S T=f-ST=f-ST=f−S is a strongly pseudocontractive map.
Consider Mann iteration with delay and set T x = f + ( I − S ) x T x = f + ( I − S ) x Tx=f+(I-S)xT x=f+(I-S) xTx=f+(I−S)x to obtain
(10) u n + 1 = ( 1 − α n ) u n − s + α n ( f + ( I − S ) u n − s ) (10) u n + 1 = 1 − α n u n − s + α n f + ( I − S ) u n − s {:(10)u_(n+1)=(1-alpha_(n))u_(n-s)+alpha_(n)(f+(I-S)u_(n-s)):}\begin{equation*} u_{n+1}=\left(1-\alpha_{n}\right) u_{n-s}+\alpha_{n}\left(f+(I-S) u_{n-s}\right) \tag{10} \end{equation*}(10)un+1=(1−αn)un−s+αn(f+(I−S)un−s)
Remarks 6 and 7 and Theorem 5 lead to the following results.
Corollary 8 Let X X XXX be a real Banach space with a uniformly convex dual X ∗ X ∗ X^(**)X^{*}X∗, and S : X → X S : X → X S:X rarr XS: X \rightarrow XS:X→X a continuous and strongly accretive map with ( I − S ) ( X ) ( I − S ) ( X ) (I-S)(X)(I-S)(X)(I−S)(X) bounded, { α n } α n {alpha_(n)}\left\{\alpha_{n}\right\}{αn} satisfies (2), and u 0 = x 0 ∈ X u 0 = x 0 ∈ X u_(0)=x_(0)in Xu_{0}=x_{0} \in Xu0=x0∈X, then, the Mann iteration with delay (10) converges to the solution of S x = f S x = f Sx=fS x=fSx=f.
Let S S SSS be an accretive operator. The operator T x = f − S x T x = f − S x Tx=f-SxT x=f-S xTx=f−Sx is strongly pseudocontractive, for a given f ∈ X f ∈ X f in Xf \in Xf∈X. A solution for T x = x T x = x Tx=xT x=xTx=x becomes a solution for x + S x = f x + S x = f x+Sx=fx+S x=fx+Sx=f. Consider Mann iteration with delay, set T x := f − S x T x := f − S x Tx:=f-SxT x:=f-S xTx:=f−Sx such that
(11) u n + 1 = ( 1 − α n ) u n − s + α n ( f − S u n − s ) (11) u n + 1 = 1 − α n u n − s + α n f − S u n − s {:(11)u_(n+1)=(1-alpha_(n))u_(n-s)+alpha_(n)(f-Su_(n-s)):}\begin{equation*} u_{n+1}=\left(1-\alpha_{n}\right) u_{n-s}+\alpha_{n}\left(f-S u_{n-s}\right) \tag{11} \end{equation*}(11)un+1=(1−αn)un−s+αn(f−Sun−s)
Again, using the Remarks 6 and 7 and Theorem 5 we obtain the following result.
Corollary 9 Let X X XXX be a real Banach space with a uniformly convex dual X ∗ X ∗ X^(**)X^{*}X∗, and B B BBB a nonempty, convex, closed subset of X X XXX. Let S : B → B S : B → B S:B rarr BS: B \rightarrow BS:B→B be a continuous and accretive operator with ( I − S ) ( X ) ( I − S ) ( X ) (I-S)(X)(I-S)(X)(I−S)(X) bounded, { α n } α n {alpha_(n)}\left\{\alpha_{n}\right\}{αn} satisfies (2). Then, the Mann iteration with delay (11) converges to the solution of x + S x = f x + S x = f x+Sx=fx+S x=fx+Sx=f.

References

[1] C.E. Chidume, Approximation of fixed points of strongly pseudocontractive mappings, Proc. Amer. Math. Soc., 120, 2, 1994, 545-551.
[2] K. Deimling, Zeros of accretive operators, Manucripta Math. 13 (1974), 283288.
[3] Z. Haiyun, J. Yuting, Approximation on fixed points on strongly psedocontractive maps without Lipschitz assumption, Proc. Amer. Math. Soc., 125, 6, 1997, 1705-1709.
[4] S. Ishikawa, Fixed Points by a New Iteration Method, Proc. Amer. Math. Soc. 44 (1974), 147-150.
[5] W. R. Mann, Mean Value in Iteration, Proc. Amer. Math. Soc. 4 (1953), 506-510.
[6] X. Weng, Fixed Point Iteration for Local Strictly Pseudocontractive Mapping, Proc. Amer. Math. Soc. 113 (1991), 727-731.
2007

Related Posts