ٖ୯ௐࣸ૾ʹؔ͢Δมෆࣜͷ൧௩
-
ߴڮܕۙࣅྻͷ
ͭੑ࣭
Properties of Iiduka-Takahashi type iterations of variational inequality problems for pseudomonotone mappings
๛ాণ࢙ Masashi Toyoda
ۄେֶֶ෦ϚωδϝϯταΠΤϯεֶՊ, 194–8610 ౦ژொాࢢۄֶԂ 6–1–1 College of Engineering, Tamagawa University,
6–1–1 Tamagawa-gakuen, Machida-shi, Tokyo 194–8610
Abstract
In this paper, we introduce an iteration for finding an element of the set of solutions of the variational inequality for a psuedomonotone mapping in a Hilbert space. Moreover, we consider strong convergence of the iteration to the solution of variational inequality problem.
Keywords: Variational inequality, pseudomonotone mapping, strong convergence.
ୈ1અ ͡Ίʹ H Λ Hilbert ۭؒͱ͠, C Λ H ͷดತू ߹ͱ͢Δ. A Λ C ͔Β H ͷࣸ૾ͱ͢Δ. x∗ ∈ C ͕มෆࣜͷղͰ͋Δͱ, ҙͷ x∈ C ʹରͯ͠ ⟨Ax∗, x− x∗� ≥ 0 ΛΈͨ͢ͱ͖Λ͍͏. มෆࣜͷղશମ ͷू߹ΛVI(C, A) ͱ͋ΒΘ͢. ͋Δ α > 0͕ ଘࡏͯ͠,ҙͷx, y∈ C ʹରͯ͠
⟨Ax − Ay, x − y� ≥ α∥Ax − Ay∥2 ΛΈͨ͢ͱ͖, ࣸ૾ A Λٯڧ୯ௐ (inverse-strongly monotone) ͱ͍͏. A ͕ٯڧ୯ௐࣸ ૾ͷ߹,มෆࣜͷղʹڧऩଋ͢Δ݁ Ռ͕طʹಘΒΕ͍ͯΔ. ࣮ࡍ, 2004,൧௩-ߴ ڮ[4]n = 1, 2, 3, . . . ʹରͯ͠ xn+1= αnx + (1− αn)PC(xn− λnAxn) ͰఆΊΔۙࣅྻ(Ҏ߱,൧௩-ߴڮܕۙࣅྻͱݺ Ϳ)Λಋೖ͠,มෆࣜͷղʹڧऩଋ͢Δ ͜ͱΛࣔͨ͠. ͜͜Ͱ{αn} (0, 1) ͷྻͰ lim n→∞αn= 0, ∞ ∑ n=1 αn=∞ ͓Αͼ ∞ ∑ n=1 |αn+1− αn| < ∞ ΛΈͨ͢ͷͱ͢Δ. {λn} (0, 1) ͷ෦۠ ؒ[a, b]ͷྻͰ ∞ ∑ n=1 |λn+1− λn| < ∞ ΛΈͨ͢ͷͱ͢Δ. PC H ͔Β C ͷ্ ͷڑࣹӨͰ͋Δ. [8, 9]ࢀর͞Ε͍ͨ. ͞ Βʹ, 2011, ੨ࢁ[1], {αn} ͱ {λn} ͷ ݅Λ lim n→∞αn= 0, ∞ ∑ n=1 αn=∞ ͓Αͼ 0 < inf n λn≤ supn λn< 2α ʹऑΊͨͱͯ͠,൧௩-ߴڮܕۙࣅྻ͕,ม ෆࣜͷղʹڧऩଋ͢Δ͜ͱΛࣔͨ͠. ͜ ͜Ͱα ٯڧ୯ௐࣸ૾ A ͷͰ͋Δ. ͜Ε
Βͷݚڀ͕ࣔ͢Α͏ʹ, A Λٯڧ୯ௐࣸ૾ͱ͢ Δͱ͖,൧௩-ߴڮܕۙࣅྻ{αn}, {λn}ʹର ͯ͠ेͳԾఆΛ͢Ε,มෆࣜͷղ ʹڧऩଋ͢Δ͜ͱ͕ΒΕ͍ͯΔ. Ұํ,ࣸ૾ A͕༗քͰ,͞Βʹ x ʹऑऩଋ ͢Δྻ{xn} ͕ lim sup n→∞ ⟨Axn, xn− x⟩ ≤ 0 ΛΈͨ͢ͳΒ,ҙͷ y∈ C ʹରͯ͠ ⟨Ax, x − y⟩ ≤ lim infn
→∞ ⟨Ax, xn− y⟩ ͕Γཱͭͱ͖, ࣸ૾ A Λٖ୯ௐ (psue-domonotone) ͱ͍͏. A ͕ٖ୯ௐࣸ૾ͷ߹ ͷมෆࣜ,ྫ͑, [3, 5, 6, 2]ͰѻΘ Ε͍ͯΔ. A͕ٖ୯ௐࣸ૾ͷ߹,มෆࣜ ͷղʹऑऩଋ͢Δ݁ՌಘΒΕ͍ͯΔͷ ͷ([3, 6]), චऀͷΔݶΓ, ͍·ͩڧऩଋ͢Δ ݁ՌΛಘΒΕ͍ͯͳ͍. A͕ٖ୯ௐࣸ૾ͷ߹ Ͱ,มෆࣜͷղʹڧऩଋ͢Δۙࣅྻ ߏͰ͖ΔͰ͋Ζ͏͔. ٯڧ୯ௐࣸ૾ʹ߹ͰڧऩଋΛಘΒΕͯ ͍Δ൧௩-ߴڮܕۙࣅྻΛར༻͢Ε,ٖ୯ௐࣸ ૾ͷ߹ͷมෆࣜͷղͷڧऩଋఆཧ ΛಘΒΕΔ͔͠Εͳ͍. ͦ͜Ͱຊจʹ͓͍ ͯ, A ͕ٖ୯ௐࣸ૾ͷ߹,൧௩-ߴڮܕۙࣅྻ ͕ͲͷΑ͏ͳੑ࣭Λͭͷ͔Λߟ͢Δ. ·ͨ, ڧ͍ԾఆͰ͋Δ͕,൧௩-ߴڮܕۙࣅྻ͕ڧऩ ଋ͢ΔͨΊͷे݅Λࣔ͢. ୈ2અ ४උ H Λ Hilbert ۭؒͱ͠, C Λ H ͷดತू ߹ͱ͢Δ. ҙͷ x∈ H ʹରͯ͠ ∥x − z∥ = min{∥x − y∥ | y ∈ C} ͱͳΔΑ͏ͳz∈ C͕Ұҙʹଘࡏ͢Δ. PCx = z Ͱද͠, PC Λ C ͔ΒH ͷ্ͷڑࣹ Өͱ͍͏. ڑࣹӨPC ʹରͯ͠, z = PCx Ͱ ͋ΔͨΊͷඞཁे݅ ⟨x − z, z − y⟩ ≥ 0 ͕ҙͷy∈ C ʹରͯ͠Γཱͭ͜ͱͰ͋Δ. ৄ͘͠[7]Λࢀর͞Ε͍ͨ. AΛC͔ΒH ͷࣸ૾ͱ͢Δ. ࣸ૾A͕ ίΞγϒ(coercive)Ͱ͋Δͱ,ҙͷ x∈ C ʹରͯ͠ ⟨Ax, x⟩ ≥ ∥x∥2 ͕Γཱͭͱ͖Λ͍͏. ࣸ૾A͕ٖ୯ௐ (psue-domonotone) Ͱ͋Δͱ, A ͕࣍ͷ(I)(II)Λ Έͨ͢ͱ͖Λ͍͏. (I) A ༗քͰ͋Δ. (II) xʹऑऩଋ͢Δྻ{xn} ͕ lim sup n→∞ ⟨Axn, xn− x⟩ ≤ 0 ΛΈͨ͢ͱ͖,ҙͷ y∈ C ʹରͯ͠ ⟨Ax, x − y⟩ ≤ lim infn
→∞ ⟨Ax, xn− y⟩ ͕Γཱͭ. ࣸ૾A͕ϙςϯγϟϧ(potential)Ͱ͋Δͱ, ҙͷx, y∈ C ʹରͯ͠ ∫ 1 0
(⟨A(t(x + y)), x + y⟩ − ⟨A(tx), x⟩) dt =
∫ 1
0 ⟨A(x + ty), y⟩dt
ΛΈͨ͢ͱ͖Λ͍͏. ࣸ૾A͕Ϧϓγοπ࿈ଓ
(Lipschitz continuous)Ͱ͋Δͱ,͋ΔL > 0 ͕ଘࡏͯ͠,ҙͷ x, y∈ C ʹରͯ͠
∥Ax − Ay∥ ≤ L∥x − y∥
͕Γཱͭͱ͖Λ͍͏. C ͷྻ{xn}Λ࣍ͷΑ͏ʹఆٛ͢Δ. x∈ C ͱ͢Δ. x1 = xͱ͢Δ. n = 1, 2, 3, . . .ʹର ͯ͠ xn+1= αnx + (1− αn)PC(xn− λnAxn) ͱ͢Δ. ͜͜Ͱ {αn} (0, 1) ͷྻͰ͋Δ. ·ͨ{λn} (0, 1) ͷ෦۠ؒ[a, b] ͷྻͰ ͋Δ. ҎԼ,֤nʹରͯ͠ yn= PC(xn− λnAxn) ͱ͓͘. ิॿ໋ 1. ࣸ૾ A ٖ୯ௐͱ͢Δ. ྻ {xn}, {yn} ༗քͰ͋Δͱ͠ xn− yn→ 0 ͱ͢Δ. ͜ͷͱ͖, ྻ {xn} ͷ෦ྻ {xni} ͷऑऩଋઌ x∗ มෆࣜͷղͰ͋Δ. ͢ͳΘͪ x∗ ∈ VI(C, A)Ͱ͋Δ.
ূ໌. ·ͣ,ҙͷ y∈ C ʹରͯ͠ lim inf n→∞ ⟨Axn, xn− y⟩ ≤ 0 ͓Αͼ lim sup n→∞ ⟨Axn, xn− y⟩ ≤ 0 ͕Γཱͭ͜ͱΛࣔ͢. yn= PC(xn− λnAxn) ΑΓ,ҙͷ y∈ C ʹରͯ͠ ⟨yn− (xn− λnAxn), y− yn⟩ ≥ 0 Ͱ͋Δ. ͕ͨͬͯ͠ ⟨yn− xn, xn− yn⟩ ≥ ⟨−λnAxn, y− yn⟩, ͢ͳΘͪ −λ1 n∥xn− yn∥∥v − yn∥ ≥ ⟨Axn , yn− y⟩ ΛಘΔ. y∈ C ͱ͢Δ. ͜ͷͱ͖ ⟨Axn, xn− y⟩
=⟨Axn, xn− yn⟩ + ⟨Axn, yn− y⟩
≤ ⟨Axn, xn− yn⟩ + 1 λn∥yn− xn∥∥y − yn∥ ≤ ∥Axn∥∥xn− yn∥ + 1 a∥xn− yn∥∥y − yn∥ Ͱ͋Δ. ͜͜Ͱ {λn} ⊂ [a, b] Ͱ͋Δ͜ͱʹ ҙ͞Ε͍ͨ. {xn}, {yn} ༗ք, ࣸ૾ A ༗ քͰ, xn− yn→ 0 Ͱ͋Δ͔Β lim inf n→∞ ⟨Axn, xn− y⟩ ≤ 0 ͓Αͼ lim sup n→∞ ⟨Axn, xn− y⟩ ≤ 0 ΛಘΔ. ্هͷ y ͷΘΓʹ x∗ Ͱߟ͑Εಉ༷ʹ ෆࣜ ⟨Axni, xni− x∗⟩ ≤ ∥Axni∥∥xni− yni∥ + 1 a∥xni− yni∥∥x∗− yni∥ ΛಘΔ. Αͬͯ lim sup i→∞ ⟨Axni , xni− x∗⟩ ≤ 0 ͕Γཱͭ. y∈ C ͱ͢Δ. A ٖ୯ௐͰ͋Δ ͔Β
⟨Ax∗, x∗− v⟩ ≤ lim inf
i→∞ ⟨Axni, xni− y⟩
Ͱ͋Δ. ͜ΕΑΓ
⟨Ax∗, x∗− y⟩ ≤ lim inf
i→∞ ⟨Axni, xni − y⟩ ≤ 0 ΛಘΔ. ͢ͳΘͪ ⟨Ax∗, y− x∗⟩ ≥ 0 Ͱ͋Δ. □ ໋ 2. H Λ Hilbert ۭؒͱ͠, C Λ H ͷด ತू߹ͱ͢Δ. AΛC ͔ΒH ͷٖ୯ௐࣸ૾ ͱ͢Δ. C ͷྻ{xn}Λ࣍ͷΑ͏ʹఆٛ͢Δ. x∈ C ͱ͢Δ. x1 = x ͱ͢Δ. n = 1, 2, 3, . . . ʹରͯ͠ xn+1= αnx + (1− αn)PC(xn− λnAxn) ͱ͢Δ. ͜͜Ͱ {αn} (0, 1) ͷྻͰ͋ Δ. ·ͨ {λn} (0, 1) ͷ෦۠ؒ [a, b] ͷ ྻͰ͋Δ. yn = PC(xn− λnAxn) ͱ͓͘. x∗ = PVI(C,A)x ͱ͓͘. ྻ {xn}, {yn} ༗քͰ͋Δͱ͠, xn − yn → 0 ͱ͠, ͞Βʹ n = 1, 2, 3, . . . ʹରͯ͠ ∥yn− x∗∥ ≤ ∥xn− x∗∥ ΛΈͨ͢ͱ͢Δ. ·ͨ ∞ ∑ n=1 αn=∞ ΛΈͨ͢ͱ͢Δ. ͜ͷͱ͖ {xn} x∗ ʹڧऩ ଋ͢Δ. ূ໌. ·ͣ lim sup n→∞ ⟨x − x ∗, x n− x∗⟩ ≤ 0 ͕Γཱͭ͜ͱΛࣔ͢. {xn} ༗քͰ͋Δ͔ Β,෦ྻ{xni} ͕ଘࡏͯ͠x∗ ʹऑऩଋ͢Δ.
ิॿ໋ 1 ΑΓ x∗ ∈ VI(C, A) Ͱ͋Δ. ͨ͠ ͕ͬͯ lim sup n→∞ ⟨x − x ∗, x n− x∗⟩ = lim i→∞⟨x − x ∗, x ni − x∗⟩ =⟨x − x∗, x∗− x∗⟩ ≤ 0 ΛಘΔ. ϵ > 0 ͱ͢Δ. lim supn→∞⟨x − x∗, xn− x∗⟩ ≤ 0 ΑΓ,͋Δࣗવ n0 ͕ଘࡏͯ͠,ҙ ͷn≥ n0 ʹରͯ͠ ⟨x − x∗, xn− x∗⟩ < ϵ ͕Γཱͭ. ·ͨ αnx + (1− αn)yn− (αnx + (1− αn)x∗) = xn+1− x∗+ αn(x∗− x) Ͱ͋Δ͔Β ∥αnx + (1− αn)yn− (αnx + (1− αn)x∗)∥2 ≥ ∥xn+1− x∗∥2+ 2αn⟨x∗− x, xn+1− x∗⟩ ΛಘΔ. Αͬͯn≥ n0 ʹରͯ͠ ∥xn+1− x∗∥2 ≤ 2αn⟨x − x∗, xn+1− x∗⟩ + (1− αn)2∥yn− x∗∥2 ≤ 2αn⟨x − x∗, xn+1− x∗⟩ + (1− αn)2∥xn− x∗∥2 ≤ 2αnϵ + (1− αn)∥xn− x∗∥2 = 2ϵ (1− (1 − αn)) + (1− αn)∥xn− x∗∥2 Ͱ͋Δ. ͕ͨͬͯ͠ ∥xn+1− x∗∥2 ≤ 2ϵ 1 − n ∏ k=n0 (1− αk) + n ∏ k=n0 (1− αk)∥xn0− x∗∥ 2 ͕Γཱͭ. ͜ΕΑΓ lim sup n→∞ ∥xn+1− x ∗∥2 ≤ 2ϵ Ͱ͋Δ. ϵ ҙͷਖ਼Ͱ͋Δ͔Β lim sup n→∞ ∥xn+1− x ∗∥2≤ 0 Ͱ͋Δ. ͕ͨͬͯ͠xn→ x∗ ΛಘΔ. □ ୈ3અ ͓ΘΓʹ ໋ 2 Ͱ, {xn} ͕มෆࣜͷղ x∗ ʹڧऩଋ͢ΔͨΊʹ,ྻ {xn}, {yn}༗ քͰ͋Δͱ͠, xn− yn→ 0 ͱ͠ ∥yn− x∗∥ ≤ ∥xn− x∗∥ ΛΈͨ͢ͱԾఆͨ͠. ࠓޙͷ՝, ͜ΕΒͷ ԾఆΛΈͨ͢{αn}, {λn} ͷ݅ΛݟۃΊΔ͜ ͱͰ͋Δ. ·ͩ,ղܾͰ͖͍ͯͳ͍͕,͜͜Ͱ [3, 6]Λࢀߟʹ,ߟΛਐΊ͓ͯ͘. ิॿ໋ 3. ࣸ૾ A ϙςϯγϟϧͱ͠, Ϧ ϓγοπ࿈ଓͱ͢Δ. A Λ༻͍ͨࣸ૾ Φ Λ, x∈ C ʹରͯ͠ Φ(x) = ∫ 1 0 ⟨A(tx), x⟩dt ͰఆΊΔ. ͜ͷͱ͖, ҙͷ n = 1, 2, 3, . . . ʹ ରͯ͠ Φ(yn) + ( 1 b − L 2 ) ∥xn− yn∥2 ≤ Φ(xn) ͕Γཱͭ. ূ໌. yn= PC(xn− λnAxn) ΑΓ ⟨yn− (xn− λnAxn), xn− yn⟩ ≥ 0 Ͱ͋Δ. Αͬͯ ⟨yn− xn, xn− yn⟩ ≥ ⟨−λnAxn, xn− yn⟩ Ͱ͋Δ. ͞Βʹ −λ1 n∥xn− yn∥ 2≥ ⟨−Ax n, xn− yn⟩ Ͱ͋Δ. A Ϧϓγοπ࿈ଓͰ͋Δ͔Β |⟨A(xn+ t(yn− xn))− Axn, y−xn⟩|
≤ ∥A(xn+ t(yn− xn))− Axn∥∥yn− xn∥
Ͱ͋Δ. ͕ͨͬͯ͠, AϙςϯγϟϧͰ͋Δ ͔Β Φ(yn)− Φ(xn) ∫ 1 0 ⟨A(ty n), yn⟩dt − ∫ 1 0 ⟨A(tx n), xn⟩dt = ∫ 1 0 ⟨A(xn + t(yn− xn)), yn− xn⟩dt = ∫ 1 0 A(xn+ t(yn− xn))− Axn, yn− xn⟩dt +⟨Axn, yn− xn⟩ ≤ ∫ 1 0 Lt∥yn− xn∥2dt− 1 λn∥xn− yn∥ 2 = ( L 2 − 1 λn ) ∥xn− yn∥2 ≤ ( L 2 − 1 b ) ∥xn− yn∥2 Ͱ͋Δ. Αͬͯ Φ(yn) + ( 1 b − L 2 ) ∥xn− yn∥2 ≤ Φ(xn) ΛಘΔ. □ ิॿ໋3ʹ,͞Βʹ{Φ(xn)}, {Φ(yn)}ͷ ۃݶ͕ଘࡏͯ͠, Ұக͢ΔͱԾఆ͢Δ. ͜ͷ ͱ͖ Φ(yn) + ( 1 b − L 2 ) ∥xn− yn∥2 ≤ Φ(xn) ΑΓ xn− yn→ 0 Ͱ͋Δ. ͔͠ A ͕ίΞγϒͱ͠, Φ(x) ≥ Φ(xn), Φ(x) ≥ Φ(yn) ͕ΓཱͭͱԾఆ͢Δ. ͜ͷͱ͖,{xn}, {yn} ༗քͰ͋Δ. ࣮ࡍ Φ(x) ≥ Φ(xn) = ∫ 1 0 ⟨A(txn ), txn⟩ 1 tdt ≥ ∫ 1 0 1 t∥txn∥ 2dt = ∫ 1 0 1 t∥xn∥ 2dt = 1 2∥xn∥ 2 ΑΓ,{xn} ༗քͱͳΔ. ಉ༷ʹ,{yn}༗ք ͱͳΔ. Ҏ্ͷߟ͔Β, AΛίΞγϒ,ϙςϯγϟ ϧͰϦϓγοπ࿈ଓͳٖ୯ௐࣸ૾ͱ͢Δͱ͖, ࣍ͷ(I)(II)ΛΈͨ͢ {αn}, {λn} ͷे݅ Կ͔, ͱ͍͏ͷ͕͞Εͨ՝ͱͳΔ. (I) {Φ(xn)}, {Φ(yn)}ͷۃݶ͕ଘࡏͯ͠,Ұக͢ Δ. (II) Φ(x)≥ Φ(xn), Φ(x) ≥ Φ(yn) ͕Γ ཱͭ. ࢀߟจݙ
[1] K. Aoyama, Approximations to solu-tions of the variational inequality problem for inverse-strongly-monotone mappings, Proceedings of the 7th International ference on Nonlinear Analysis and Con-vex Analysis (Busan, Korea, 2011), 1–9. [2] I. B. Badriev and V. V. Banderov,
It-erative methods for solving variational inequalities of the theory of soft shells, Lobachevskii Journal of Mathematics, 35 (2014), 371–383.
[3] I. B. Badriev, O. A. Zadvornov and A. M. Saddek, Convergence analysis of iterative methods for some variational inequalities with pseudomonotone oper-ators, Differential Equations 37 (2001), 934–942.
[4] H. Iiduka and W Takahashi, Strong convergence theorems for nonexpansive nonself-mappings and inverse-strongly-monotone mappings, Journal of Convex Analysis, 11 (2004), 69–79.
[5] S. Mig´orski, Boundary hemivariational inequalities of hyperbolic type and appli-cations, Journal of Global Optimization, 31 (2005), 505–533.
[6] A. M. Saddeek and S. A. Ahmed, On the convergence of some iteration pro-cesses for J-pseudomonotone mixed vari-ational inequalities in uniformly smooth Banach spaces, Mathematical and Com-puter Modelling 46 (2007), 557–572. [7] ߴڮব, ඇઢܗؔղੳֶ–ෆಈఆཧͱ
[8] ๛ాণ࢙,ώϧϕϧτۭؒͰͷۃେ୯ௐ࡞ ༻ૉʹؔ͢Δऩଋఆཧ,ژେֶཧղੳ ݚڀॴߨڀ, 1755 (2011), 46–52. [9] ๛ాণ࢙, ٯڧ୯ௐࣸ૾ʹؔ͢Δมෆ ࣜΛѻͬͨBadriev ͱZadvornov ͷ݁ՌͷҰߟ, ۄେֶֶ෦لཁ, 47 (2012), 81–87. 20153݄13ݪߘडɹ Received, March 13, 2015