The convergence of mann iteration for an asymptotic hemicontractive map

Abstract

We prove that the Mann iteration convergence ot a fixed point of an asymptotic hemicontractive map.

Authors

Stefan M. Soltuz
Tiberiu Popoviciu Institute of Numerical analysis

Keywords

Mann iteration; fixed pont; asymptotic hemicontractive map

Paper coordinates

Ș.M. Șoltuz, The convergence of mann iteration for an asymptotic hemicontractive map, Buletinul ştiinţific al Universitatii Baia Mare, Seria B, Fascicola matematică-informatică, 18 (2002) no. 1, pp. 115-118 (Dedicated to Costica Mustata on his 60th anniversary).

PDF

About this paper

Journal

Bull. Stiint. Univ. Baia Mare, Matematica-Informatica

Publisher Name

Baia Mare University

DOI
Print ISSN

1222-1201 

Online ISSN

google scholar link

??

Paper (preprint) in HTML form

2002-Soltuz-Bull-Baia-Mare-The-convergence-of-mann-iteration 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 > 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; }
Dedeculed to Costica MUSTATA on his 60 th annwersary

THE CONVERGENCE OF MANN ITERATION FOR AN ASYMPTOTIC HEMICONTRACTIVE MAP

Ştefan M. ŞOLTUZ

Abstract. We prove that the Mam iteration converges to a fixed point of an asymptotic hemicontractive map.
MSC: 47H10
Keywords: Mann iteration, fixed point, asymptotic hemicontractive map

1. Introduction.

Let X X XXX be a real Hilbert space, let B ⊂ X B ⊂ X B sub XB \subset XB⊂X be a nonempty, convex set. Lot T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B be a map. Let N = { 1 , 2 , … } N = { 1 , 2 , … } N={1,2,dots}\mathbb{N}=\{1,2, \ldots\}N={1,2,…}. Let x 1 ∈ B x 1 ∈ B x_(1)in Bx_{1} \in Bx1∈B, be an arbitrary fixed point. We consider the iteration
(1) x n + 1 = ( 1 − α n ) x n + α n T n x n , ∀ n ∈ N . (1) x n + 1 = 1 − α n x n + α n T n x n , ∀ n ∈ N . {:(1)x_(n+1)=(1-alpha_(n))x_(n)+alpha_(n)T^(n)x_(n)","AA n in N.:}\begin{equation*} x_{n+1}=\left(1-\alpha_{n}\right) x_{n}+\alpha_{n} T^{n} x_{n}, \forall n \in N . \tag{1} \end{equation*}(1)xn+1=(1−αn)xn+αnTnxn,∀n∈N.
The sequence ( α n ) n ≥ 1 α n n ≥ 1 (alpha_(n))_(n >= 1)\left(\alpha_{n}\right)_{n \geq 1}(αn)n≥1 satisfies:
( α n ) n ≥ 1 < ( 0 , 1 ) , ∑ n = 1 ∞ α n = ∞ , lim n → ∞ α n = 0 α n n ≥ 1 < ( 0 , 1 ) , ∑ n = 1 ∞ &hairsp; α n = ∞ , lim n → ∞ &hairsp; α n = 0 (alpha_(n))_(n >= 1) < (0,1),sum_(n=1)^(oo)alpha_(n)=oo,lim_(n rarr oo)alpha_(n)=0\left(\alpha_{n}\right)_{n \geq 1}<(0,1), \sum_{n=1}^{\infty} \alpha_{n}=\infty, \lim _{n \rightarrow \infty} \alpha_{n}=0(αn)n≥1<(0,1),∑n=1∞αn=∞,limn→∞αn=0
A prototype for ( κ n ) n ≥ 1 κ n n ≥ 1 (kappa_(n))_(n >= 1)\left(\kappa_{n}\right)_{n \geq 1}(κn)n≥1 is ( 1 / n ) n ⩾ 1 ( 1 / n ) n ⩾ 1 (1//n)_(n >= 1)(1 / n)_{n \geqslant 1}(1/n)n⩾1. Iteration (1) is known as Mam iteration, sox [ 8 ] [ 8 ] [8][8][8]. We consider the following iteration, known as Ishikawa iteration, soe [6]:
(Ish) x n + 1 = ( 1 − α n ) x n + α n T n y n + 1 y n = ( 1 − β n ) x n + β n T n x n + 1 n ∈ N , (Ish) x n + 1 = 1 − α n x n + α n T n y n + 1 y n = 1 − β n x n + β n T n x n + 1 n ∈ N , {:[(Ish)x_(n+1)=(1-alpha_(n))x_(n)+alpha_(n)T^(n)y_(n+1)],[y_(n)=(1-beta_(n))x_(n)+beta_(n)T^(n)x_(n+1)quad n inN","]:}\begin{gather*} x_{n+1}=\left(1-\alpha_{n}\right) x_{n}+\alpha_{n} T^{n} y_{n+1} \tag{Ish}\\ y_{n}=\left(1-\beta_{n}\right) x_{n}+\beta_{n} T^{n} x_{n+1} \quad n \in \mathbb{N}, \end{gather*}(Ish)xn+1=(1−αn)xn+αnTnyn+1yn=(1−βn)xn+βnTnxn+1n∈N,
where ( α n ) n , ( β n ) n ⊂ ( 0 , 1 ) α n n , β n n ⊂ ( 0 , 1 ) (alpha_(n))_(n),(beta_(n))_(n)sub(0,1)\left(\alpha_{n}\right)_{n},\left(\beta_{n}\right)_{n} \subset(0,1)(αn)n,(βn)n⊂(0,1). Choosing β n = 0 , ∀ n ∈ N β n = 0 , ∀ n ∈ N beta_(n)=0,AA n inN\beta_{n}=0, \forall n \in \mathbb{N}βn=0,∀n∈N, from ( T s h T s h TshT s hTsh ) we get (1).
Let us denote by F ( T ) F ( T ) F(T)F(T)F(T) the set of fixed points of the operator T T TTT. We need the following . definition, see for example [10]:
Definition 1. The map T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B is culled asymptotically bemicumtractme with sequence ( k n ) n k n n (k_(n))_(n)\left(k_{n}\right)_{n}(kn)n, if and only if lim n → ∞ , k n , − 1 , F ( T ) ≠ ∅ lim n → ∞ &hairsp; , k n , − 1 , F ( T ) ≠ ∅ lim_(n rarr oo),k_(n),-1,F(T)!=O/\lim _{n \rightarrow \infty}, k_{n},-1, F(T) \neq \emptysetlimn→∞,kn,−1,F(T)≠∅ such that
(2) ‖ T n x − x ∗ ‖ 2 ≤ k n ‖ x − x ∗ ‖ 2 + ‖ x − T n x ‖ 2 , ∀ x ∈ B , x ∗ ∈ F ( T ) , ∀ n ∈ N . (2) T n x − x ∗ 2 ≤ k n x − x ∗ 2 + x − T n x 2 , ∀ x ∈ B , x ∗ ∈ F ( T ) , ∀ n ∈ N . {:(2)||T^(n)x-x^(**)||^(2) <= k_(n)||x-x^(**)||^(2)+||x-T^(n)x||^(2)","AA x in B","x^(**)in F(T)","AA n inN.:}\begin{equation*} \left\|T^{n} x-x^{*}\right\|^{2} \leq k_{n}\left\|x-x^{*}\right\|^{2}+\left\|x-T^{n} x\right\|^{2}, \forall x \in B, x^{*} \in F(T), \forall n \in \mathbb{N} . \tag{2} \end{equation*}(2)‖Tnx−x∗‖2≤kn‖x−x∗‖2+‖x−Tnx‖2,∀x∈B,x∗∈F(T),∀n∈N.
In this note, we will consider
k n < 1 , ∀ n ∈ N . k n < 1 , ∀ n ∈ N . k_(n) < 1,AA n inN.k_{n}<1, \forall n \in \mathbb{N} .kn<1,∀n∈N.
In context of Hilbert spaces, the convergence of Ishikawa iteration (I ah) to the fixed point of T T TTT, when we deal with s asymptotically hemicontractive map (with k n > 1 , V n ∈ k n > 1 , V n ∈ k_(n) > 1,Vn ink_{n}>1, \mathrm{~V} n \inkn>1, Vn∈ N), could be found in [10]. A convergence result in normed spaces for (Ish) (with ( α n ) n , ( β n ) n ⊂ ( 0 , 1 ) α n n , β n n ⊂ ( 0 , 1 ) (alpha_(n))_(n),(beta_(n))_(n)sub(0,1)\left(\alpha_{n}\right)_{n},\left(\beta_{n}\right)_{n} \subset(0,1)(αn)n,(βn)n⊂(0,1) being not convergent to zero), could be found in [0]. Anyway, in [5], we deal with an asymptotic hemicontractive like map, which is not the same as in Definition 2 with condition (2). Let us remark that:
(i) In [ 10 ] [ 10 ] [10][10][10] and ( 5 ) ( 5 ) (5)(5)(5), the sequentes ( α n ) n ( β n ) n ⊂ ( 0 , 1 ) α n n β n n ⊂ ( 0 , 1 ) (alpha_(n))_(n)(beta_(n))_(n)sub(0,1)\left(\alpha_{n}\right)_{n}\left(\beta_{n}\right)_{n} \subset(0,1)(αn)n(βn)n⊂(0,1) are not convergent to zero, because of the cxistonce of an c > 0 c > 0 c > 0c>0c>0 such that c ≤ α n ≤ β n , ∀ n ∈ N c ≤ α n ≤ β n , ∀ n ∈ N c <= alpha_(n) <= beta_(n,)AA n inNc \leq \alpha_{n} \leq \beta_{n,} \forall n \in \mathbb{N}c≤αn≤βn,∀n∈N. From the convergence of (Ish) (which is proved in [10] for Hilbert spaces and T T TTT asymptotic hemicontractive), with that sequences ( α n ) n , ( β n ) n α n n , β n n (alpha_(n))_(n),(beta_(n))_(n)\left(\alpha_{n}\right)_{n},\left(\beta_{n}\right)_{n}(αn)n,(βn)n, we can not dednces convergence of Mann iteration. It is impossible to bave β e = 0 , ∀ n ∈ N β e = 0 , ∀ n ∈ N beta_(e)=0,AA n inN\beta_{e}=0, \forall n \in \mathbb{N}βe=0,∀n∈N.
(ii) According to [5], convergence results of (Ish) for asymptotic hemicontractive maps, exist only in [10], (and of course in [5]). So far as we know, no other papers are dealing with asymptotic hemicontractive maps and Mann iteration (1).
This two reasons lead us to remark a lack of a convergenoe result which deal with Mann iteration (1) for an bsymptotic hemicontractive map. In particular for a map asymptotically hemicontractive with sequence ( k n ) n , k n < 1 k n n , k n < 1 (k_(n))_(n),k_(n) < 1\left(k_{n}\right)_{n}, k_{n}<1(kn)n,kn<1, ''n ∈ N ∈ N in N\in N∈N. Our aim is to prove a result which deal with the convergence of Mamn-iteration (1) for an asymptotic hemicontractive map as in Definition 1.
The following lemma can be found in [11] as Lemma 4. Also, it can be found in [12] as Lemma 1.2, with an other proof. In | 1 | | 1 | |1||1||1| can be found as Lemma 2.
Lemma 1 [1]. , [11]. [12] Let ( α n ) n ≥ 1 α n n ≥ 1 (alpha_(n))_(n >= 1)\left(\alpha_{n}\right)_{n \geq 1}(αn)n≥1 be a nonnegotive sequence which verzfies
a n + 1 ≤ ( 1 − λ n ) a n + σ n , a n + 1 ≤ 1 − λ n a n + σ n , a_(n+1) <= (1-lambda_(n))a_(n)+sigma_(n),a_{n+1} \leq\left(1-\lambda_{n}\right) a_{n}+\sigma_{n},an+1≤(1−λn)an+σn,
where: ( λ n ) n > 1 ⊂ ( 0.1 ) , ∑ π = 1 ∞ λ n = cos λ n n > 1 ⊂ ( 0.1 ) , ∑ π = 1 ∞ &hairsp; λ n = cos (lambda_(n))_(n > 1)sub(0.1),sum_(pi=1)^(oo)lambda_(n)=cos\left(\lambda_{n}\right)_{n>1} \subset(0.1), \sum_{\pi=1}^{\infty} \lambda_{n}=\cos(λn)n>1⊂(0.1),∑π=1∞λn=cos and σ n = o ( λ n ) σ n = o λ n sigma_(n)=o(lambda_(n))\sigma_{n}=o\left(\lambda_{n}\right)σn=o(λn). Then lim n → ∞ , a n ≠ 0 n → ∞ , a n ≠ 0 n rarr oo,a_(n)!=0n \rightarrow \infty, a_{n} \neq 0n→∞,an≠0.
The following result is from 61 :
Lemma 2 [6]. Let X X XXX be a real Hilbert space, the following relation is frue for all x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X, and for all λ ∈ ( 0 , 1 ) λ ∈ ( 0 , 1 ) lambda in(0,1)\lambda \in(0,1)λ∈(0,1) :
(3) ‖ ( 1 − λ ) x + λ y ‖ 2 = ( 1 − λ ) ‖ x ‖ 2 + λ ‖ y ‖ 2 − λ ( 1 − λ ) ‖ x − y ‖ 2 (3) ‖ ( 1 − λ ) x + λ y ‖ 2 = ( 1 − λ ) ‖ x ‖ 2 + λ ‖ y ‖ 2 − λ ( 1 − λ ) ‖ x − y ‖ 2 {:(3)||(1-lambda)x+lambda y||^(2)=(1-lambda)||x||^(2)+lambda||y||^(2)-lambda(1-lambda)||x-y||^(2):}\begin{equation*} \|(1-\lambda) x+\lambda y\|^{2}=(1-\lambda)\|x\|^{2}+\lambda\|y\|^{2}-\lambda(1-\lambda)\|x-y\|^{2} \tag{3} \end{equation*}(3)‖(1−λ)x+λy‖2=(1−λ)‖x‖2+λ‖y‖2−λ(1−λ)‖x−y‖2

2. Main result

We are able now to give the following result:
Theorem 1. Let X X XXX he a real Hilbert syme and let B ⊂ X B ⊂ X B sub XB \subset XB⊂X be a nonempty convex bounded set, and T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B be an asymptotic homicontractive map with ( α n ) n ≥ 1 k n < 1 α n n ≥ 1 k n < 1 (alpha_(n))_(n >= 1)k_(n) < 1\left(\alpha_{n}\right)_{n \geq 1} k_{n}<1(αn)n≥1kn<1. Let { x ∗ } = F ( T ) x ∗ = F ( T ) {x^(**)}=F(T)\left\{x^{*}\right\}=F(T){x∗}=F(T). Ir ( α n ) n α n n (alpha_(n))_(n)\left(\alpha_{n}\right)_{n}(αn)n given by (1) verifies α n = o ( ( 1 − k n ) ) α n = o 1 − k n alpha_(n)=o((1-k_(n)))\alpha_{n}=o\left(\left(1-k_{n}\right)\right)αn=o((1−kn)), then the Mann iteration ( x n ) n ≥ 1 x n n ≥ 1 (x_(n))_(n >= 1)\left(x_{n}\right)_{n \geq 1}(xn)n≥1, given by ( 1 ) ( 1 ) (1)(1)(1), is comprgent to x ∗ x ∗ x^(**)x^{*}x∗, for all x 1 ∈ B x 1 ∈ B x_(1)in Bx_{1} \in Bx1∈B.
Proof. The sequence ( ‖ x n − x ∗ ‖ ) n x n − x ∗ n (||x_(n)-x^(**)||)_(n)\left(\left\|x_{n}-x^{*}\right\|\right)_{n}(‖xn−x∗‖)n is woll-defined, bexause x ∗ x ∗ x^(**)x^{*}x∗ is unique. Using (3) and (2) we have, w'v ∈ M ∈ M inM\in \mathrm{M}∈M,
‖ x n + 1 − x ∗ ‖ 2 ( 1 − α n ) ( x n − x ∗ ) + α n ( T n x n − T n x ∗ ) | 2 = ( 1 − α n ) ‖ x n − x n ‖ 2 + α n | T n x n − x n ‖ 2 − α n ( 1 − α n ) ∣ T n x n − x n ‖ 2 ≤ ( 1 − α n ) ‖ x n − x ∗ ‖ 2 + α n ( x n ‖ x n − x ∗ ‖ 2 + ∣ T n x n − x n ‖ 2 ) = ( 1 − α n ( 1 − α n ) ∣ T n x n − x n ‖ 2 − α n ( 1 − α n ) ‖ x n ‖ n 2 + α n k n ‖ x n − x n ‖ 2 + α n ‖ T n x n − x n ‖ 2 = ( 1 − α n ( 1 − x n ) ) ‖ x n − x n ‖ 2 + α n 2 ‖ T n x n − x n ‖ 2 ≤ ( 1 − α n ( 1 − k n ) ) ‖ x n − x n ‖ 2 + α n 2 M x n + 1 − x ∗ 2 1 − α n x n − x ∗ + α n T n x n − T n x ∗ 2 = 1 − α n x n − x n 2 + α n T n x n − x n 2 − α n 1 − α n ∣ T n x n − x n 2 ≤ 1 − α n x n − x ∗ 2 + α n x n x n − x ∗ 2 + ∣ T n x n − x n ‖ 2 = 1 − α n 1 − α n ∣ T n x n − x n ‖ 2 − α n 1 − α n x n n 2 + α n k n x n − x n 2 + α n T n x n − x n 2 = 1 − α n 1 − x n x n − x n 2 + α n 2 T n x n − x n 2 ≤ 1 − α n 1 − k n x n − x n 2 + α n 2 M {:[||x_(n+1)-x^(**)||^(2)(1-alpha_(n))(x_(n)-x^(**))+alpha_(n)(T^(n)x_(n)-T^(n)x^(**))|^(2)],[=(1-alpha_(n))||x_(n)-x^(n)||^(2)+alpha_(n)|T^(n)x_(n)-x^(n)||^(2)-alpha_(n)(1-alpha_(n))∣T^(n)x_(n)-x_(n)||^(2):}],[ <= (1-alpha_(n))||x_(n)-x^(**)||^(2)+alpha_(n)(x_(n)||x_(n)-x^(**)||^(2)+∣T^(n)x_(n)-x_(n)||^(2))],[=(1-alpha_(n)(1-alpha_(n))∣T^(n)x_(n)-x_(n)||^(2):}],[-alpha_(n)(1-alpha_(n))||x^(n)||_(n)^(2)+alpha_(n)k_(n)||x_(n)-x_(n)||^(2)+alpha_(n)||T^(n)x_(n)-x_(n)||^(2)],[=(1-alpha_(n)(1-x_(n)))||x_(n)-x^(n)||^(2)+alpha_(n)^(2)||T^(n)x_(n)-x_(n)||^(2)],[ <= (1-alpha_(n)(1-k_(n)))||x_(n)-x^(n)||^(2)+alpha_(n)^(2)M]:}\begin{aligned} \left\|x_{n+1}-x^{*}\right\|^{2} & \left(1-\alpha_{n}\right)\left(x_{n}-x^{*}\right)+\left.\alpha_{n}\left(T^{n} x_{n}-T^{n} x^{*}\right)\right|^{2} \\ = & \left(1-\alpha_{n}\right)\left\|x_{n}-x^{n}\right\|^{2}+\alpha_{n}\left|T^{n} x_{n}-x^{n}\left\|^{2}-\alpha_{n}\left(1-\alpha_{n}\right) \mid T^{n} x_{n}-x_{n}\right\|^{2}\right. \\ \leq & \left(1-\alpha_{n}\right)\left\|x_{n}-x^{*}\right\|^{2}+\alpha_{n}\left(x_{n}\left\|x_{n}-x^{*}\right\|^{2}+\mid T^{n} x_{n}-x_{n} \|^{2}\right) \\ = & \left(1-\alpha_{n}\left(1-\alpha_{n}\right) \mid T^{n} x_{n}-x_{n} \|^{2}\right. \\ & -\alpha_{n}\left(1-\alpha_{n}\right)\left\|x^{n}\right\|_{n}^{2}+\alpha_{n} k_{n}\left\|x_{n}-x_{n}\right\|^{2}+\alpha_{n}\left\|T^{n} x_{n}-x_{n}\right\|^{2} \\ = & \left(1-\alpha_{n}\left(1-x_{n}\right)\right)\left\|x_{n}-x^{n}\right\|^{2}+\alpha_{n}^{2}\left\|T^{n} x_{n}-x_{n}\right\|^{2} \\ \leq & \left(1-\alpha_{n}\left(1-k_{n}\right)\right)\left\|x_{n}-x^{n}\right\|^{2}+\alpha_{n}^{2} M \end{aligned}‖xn+1−x∗‖2(1−αn)(xn−x∗)+αn(Tnxn−Tnx∗)|2=(1−αn)‖xn−xn‖2+αn|Tnxn−xn‖2−αn(1−αn)∣Tnxn−xn‖2≤(1−αn)‖xn−x∗‖2+αn(xn‖xn−x∗‖2+∣Tnxn−xn‖2)=(1−αn(1−αn)∣Tnxn−xn‖2−αn(1−αn)‖xn‖n2+αnkn‖xn−xn‖2+αn‖Tnxn−xn‖2=(1−αn(1−xn))‖xn−xn‖2+αn2‖Tnxn−xn‖2≤(1−αn(1−kn))‖xn−xn‖2+αn2M
The last inequality is true, since the sequence ( ‖ T n x n − x n ‖ 2 ) n ≥ 1 T n x n − x n 2 n ≥ 1 (||T^(n)x_(n)-x_(n)||^(2))_(n >= 1)\left(\left\|T^{n} x_{n}-x_{n}\right\|^{2}\right)_{n \geq 1}(‖Tnxn−xn‖2)n≥1 is bounded, because B B BBB is bounded. There exists M > 0 M > 0 M > 0M>0M>0 such that ‖ T n x n − x n ‖ 2 < M T n x n − x n 2 < M ||T^(n)x_(n)-x_(n)||^(2) < M\left\|T^{n} x_{n}-x_{n}\right\|^{2}<M‖Tnxn−xn‖2<M, for all n ∈ N n ∈ N n inNn \in \mathbb{N}n∈N. We denote by a n := ‖ x n − x ∗ ‖ , λ n = α n ( 1 − k n ) , σ n = α n 2 M , ∀ n ∈ N a n := x n − x ∗ , λ n = α n 1 − k n , σ n = α n 2 M , ∀ n ∈ N a_(n):=||x_(n)-x^(**)||,lambda_(n)=alpha_(n)(1-k_(n)),sigma_(n)=alpha_(n)^(2)M,AA n inNa_{n}:=\left\|x_{n}-x^{*}\right\|, \lambda_{n}=\alpha_{n}\left(1-k_{n}\right), \sigma_{n}=\alpha_{n}^{2} M, \forall n \in \mathbb{N}an:=‖xn−x∗‖,λn=αn(1−kn),σn=αn2M,∀n∈N. Because α n = o ( ( 1 − k n ) ) α n = o 1 − k n alpha_(n)=o((1-k_(n)))\alpha_{n}= o\left(\left(1-k_{n}\right)\right)αn=o((1−kn)), we have lim n → ∞ κ n 1 − k n M = 0 lim n → ∞ &hairsp; κ n 1 − k n M = 0 lim_(n rarr oo)(kappa_(n))/(1-k_(n))M=0\lim _{n \rightarrow \infty} \frac{\kappa_{n}}{1-k_{n}} M=0limn→∞κn1−knM=0. All the conditions from Lemma 2 are fulfilled. Thus 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. The proof is complete.
In Theorem 4 we don't need any Lipschitx condition for T T TTT as in [10]

REFERENCES.

[1] S.S.Chung, Y.J. Cho, B.S. Lee, J.S. Jung, S. M. Kang, Iterative Approximutions of Fixed Poinls and Solutuons for Strongly Acoretive and Strongity Psendo-contractive Mappirigs in Banach Spucres, J. Math. Anal. Appl. 224 (1998), 149-165.
12 S.S. Chang, J.Y. Park, Y.J. Cho, Iterulive Approminations of Fixed Points Jow Asymetotically Noncrpansive Mappings in Barach Spaces, Bull. Korean Math. Snc. 37 (2000), 109-119.
[3] S.S. Chang: Sonc Reaults for Asymptotwally Paeudo-Coniractive Mappings and Asymptotically Nonerpansive Mappings, Proc. Atwer. Math. Suc, 129 (2000), 845-853.
[4] S. S. Chang, Y. J. Cho, Haiyun Zhou, Demi-closed Principle and Weuk Convergence Problems for Assymptoticaliy Nonerpansiec Mappinga, J. Korean Math. Soc. 38 (2001):6, 1245-1260.
[5] C. E. Chidume, Convergence Theorems for Asymptotically Pseudocontractive Moppings, Nonlinear Anal. 49 (2002), 1-11.
6 S. Ishikawa, Fized Points by a New Theratow Method, Proc. Amer. Math. Soc. 44 (1974), 147-150.
(7) Gang Eun KIM, Tae Hwa KIM, Mame And Ishifown Thernivens with Errora for Non-Lipschitaion mappings in Banach Spaces, Computers and Muth. Appl 42 (2001), 1565-1570.
[8] W. R. Mann, Mean Value an Itenation, Proc. Amer. Math. Sod. 4 (1953), 506-510.
[9] M.O. Osilike, S.C. Anigbosor, Weak and Strong Convergence Theorems for Fized Points Of Asymptoticolly Noneryansvive Mappings Muth. Computer Modeling 32 (2000), 1181-1191.
10'. L. Qihou, Contergence Theomens of the Sequence of Therales for asymptoticully Demicontrantive and Hemicontractive Mappings, Nonlinear Anal. 26 (1996):11, 18351842.
[11] X. Weng, Fired Pomit Iteration for Locol Structly Pseudocontracticue Mapping, Proc. Amer. Math. Soc. 113 (1991), 727-731.
[12] H. Zhou, J. Yuting, Approximation of Fzzed Points of Strongly Pseadocontractive Maps without Lipschilz Assumption, Proc. Amer. Math. Soc. 125 (1997), 1705-1709.
Receivext: 21.04.2002
Kurt Schumaher str., ur. 48, ap. 38, 67663 Kaiserslautern,
Germany.
E-mail: ssoltuzdyahoo.com
ssoliuxthotmail.com
soltuz itwm.fhg.de
2002

Related Posts