• Nenhum resultado encontrado

Comput. Appl. Math. vol.30 número1

N/A
N/A
Protected

Academic year: 2018

Share "Comput. Appl. Math. vol.30 número1"

Copied!
13
0
0

Texto

(1)

ISSN 0101-8205 www.scielo.br/cam

Regularity results for semimonotone operators

ROLANDO GÁRCIGA OTERO1∗ and ALFREDO IUSEM2∗∗

1Instituto de Economia, Universidade Federal de Rio de Janeiro,

Avenida Pasteur 250, Urca, 22290-240 Rio de Janeiro, RJ, Brazil

2Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina 110,

22460-320 Rio de Janeiro, RJ, Brazil E-mails: rgarciga@ie.ufrj.br / iusp@impa.br

Abstract. We introduce the concept of ρ-semimonotone point-to-set operators in Hilbert

spaces. This notion is symmetrical with respect to the graph ofT, as is the case for monotonicity, but not for other related notions, like e.g. hypomonotonicity, of which our new class is a relaxation. We give a necessary condition forρ-semimonotonicity ofT in terms of Lispchitz continuity of [T+ρ−1I]−1and a sufficient condition related to expansivity ofT. We also establish surjectivity results for maximalρ-semimonotone operators.

Mathematical subject classification: 47H05, 47Hxx.

Key words:hypomonotonicity, surjectivity, prox-regularity, semimonotonicity.

1 Introduction

Before introducing the class ofρ-semimonotone operators we recall the concept

of monotonicity and a few of its relaxations.

Definition 1. LetH be a Hilbert space,T :H →P(H)a point-to-set operator

andG(T)its graph.

i) T is said to be monotone iff

hxy,u−vi ≥0, ∀(x,u), (y, v)∈G(T).

#CAM-212/10. Received: 15/VIII/10. Accepted: 05/I/11. Correspondence to: Rolando Gárciga Otero

*Partially supported by CNPq.

(2)

ii) T is said to be maximal monotone if it is monotone and additionally G(T) = G(T)for all monotone operator T: H P(H) such that

G(T)⊂G(T).

iii) Forρ ∈R++,T is said to beρ-hypomonotone iff

hxy,u−vi ≥ −ρkxyk2, ∀(x,u), (y, v)∈G(T).

iv) For ρ ∈ R++, T is said to be maximal ρ-hypomonotone if it is ρ -hypomonotone and additionallyG(T) =G(T)for allρ-hypomonotone operatorT′: H →P(H)such thatG(T)G(T).

v) T is said to be premonotone iff

hxy,u−vi ≥ −σ (y)kxyk, ∀(x,u), (y, v)∈G(T),

whereσ : HRis a positive valued function defined over the whole

spaceH.

Next we introduce the class of operators which are the main subject of this paper.

Definition 2. Let T : H → P(H)be a point-to-set operator, G(T) its graph

andρ ∈(0,1)a real number.

i) T is said to beρ-semimonotone iff

hxy,u−vi ≥ −ρ

2 kxyk

2+ ku

vk2

(1)

for all(x,u), (y, v)∈G(T).

ii) T is said to be maximalρ-semimonotone if it is ρ-semimonotone and

additionallyG(T)=G(T)for allρ-semimonotone operatorT: H

P(H)such thatG(T)G(T).

(3)

We mention that we restrict the range of the parameterρto the interval(0,1)

because all operators turn out to beρ-semimonotone forρ ≥1, as can be easily

verified.

It is clear that monotone operators are both premonotone andρ-hypomonotone

for allρ > 0, and that ρ-hypomonotone operators with ρ ∈ (0,1/2) are 2ρ

-semimonotone. It is also elementary thatT isρ-hypomonotone iffTI is

monotone (I being the identity operator in H).

In order to have a clearer view of the relation among these notions, it is worth-while to look at the special case of self-adjoint linear operators in the finite dimensional case. If3(A)is the spectrum (i.e., set of eigenvalues) of the

self-adjoint linear operator A : HH, it is well known that A is monotone iff

3(A) ⊂ [0,∞) and it follows easily from the comment above that A is ρ

-hypomonotone iff3(A) ⊂ [−ρ,∞). On the other hand, linear premonotone

operators are just monotone. It is also elementary thatAisρ-semimonotone iff

3(A)⊂(−∞,−η(ρ)]∪[−β(ρ)+ ∞) ,

with 0< β(ρ) < η(ρ)given by (7) and (9), i.e., the eigenvualues of self-adjoint ρ-semimonotone operators can lie anywhere on the real line, excepting for an

open interval around−1/ρcontained in the negative halfline.

One of the main properties of maximal monotone operators is related to the regularization of the inclusion problem consisting of finding xH such that bT(x), withT monotone andbH. Such problem may have no solution,

or an infinite set of solutions, but the problemb ∈ (TI)(x)is well posed

in Hadamard’s sense for allλ >0, meaning that there exists a unique solution,

and it depends continuously onb. This is a consequence of Minty’s Theorem

(see [4]), which states that for a maximal monotone operator T, the operator TI is onto, and its inverse is Lipschitz continuous with constant L =λ−1,

(and henceforth point-to-point), for allλ >0.

When the notion of monotonicity is relaxed, one expects to preserve at least some version of Minty’s result. In the case of hypomonotonicity, the fact that

TI is monotone when T is ρ-hypomonotone easily implies that Minty’s

(4)

The situation is more complicated when T is premonotone. Examples of

premonotone operatorsT defined on the real line such thatTI fails to be

monotone for allλ >0 have been presented in [2]. Nevertheless, the following

surjectivity result has been proved in [2]: whenT is maximal premonotone and His finite dimensional thenTIis onto for allλ >0. Minty’s Theorem cannot

be invoked in this case, and the proof uses an existence result for equilibrium problems originally established in [3] and extended later on in [1].

Before discussing theρ-semimonotone case, it might be illuminating to look

at the surjetivity issue in the one-dimensional case. It is easy to check that

TI is strictly increasing when T is monotone and λ > 0, or T is ρ

-hypomonotone and λ > ρ, and furthermore the values of the regularized

operator TI go from−∞ to +∞. The surjectivity is then an easy

con-sequence of the maximality of the graph G(T). When T is pre-monotone, TI may fail to be increasing for allλ >0 (see Example 3 in [2]), but still

it holds that the operator values go from−∞ to+∞, and the surjectivity is

also guaranteed. This is not the case forρ-semimonotone operators. Not only

aρ-semimonotone operator T defined onRmay be such that TI fails to

be monotone for allλ >0, butT, and evenTI, may happen to be strictly

decreasing! (see Example 1 below). We will nevertheless manage to establish regularity ofTI when T isρ-semimonotone andλbelongs to a certain

in-terval(β(ρ), η(ρ))⊂(0,+∞), withβ(ρ),η(ρ)as in (7), (9) below (in the case

ofT like in Example 1, the surjectivity will be a consequence of the fact that T

is strictly decreasing). We cannot invoke Minty’s result in an obvious way, since

TI will not in general be monotone; rather, the proof will proceed through

the analysis of the regularity properties of the operator[T +β(ρ)I]−1+γ (ρ)I,

withγ (ρ)as in (8) below.

2 Semimonotone operators

In this section we will establish several properties of semimonotone operators. We start our analysis with some elementary ones.

(5)

Proof. The result follows immediately from Definition 2, taking into account

that(x,u)∈ G(T)iff(u,x)∈G(T−1).

We mention that monotonicity of T is also equivalent to monotonicity of T−1, but the similar statement fails to hold forρ-hypomonotone operators. In

fact, one of the motivations behind the introduction of the class of ρ

-semi-monotone operators is the preservation of this symmetry property enjoyed by monotone operators.

Proposition 2. If T : H → P(H) is ρ-semimonotone and α belongs to

(ρ,1/ρ)thenαT isρˉ-semimonotone withρˉ =ρmax{α,1/α}.

Proof. Note first that ρˉ belongs to (0,1). Let Tˉ = αT and take (x,uˉ), (y,v)ˉ ∈ G(Tˉ). By definition of Tˉ, there exist uT(x), v ∈ T(y) such

thatuˉ =αu,vˉ =αv. Byρ-semimonotonicity ofT

hxy,uˉ− ˉvi =αhxy,u−vi ≥ −ρ

2 αkxyk

2

+αku−vk2

= −ρ

2

αkxyk2+ 1

αk ˉu− ˉvk

2 ≥ −ρˉ

2 kxyk

2

+ k ˉu− ˉvk2,

establishingρˉ-semimonotonicity ofTˉ =αT.

Proposition 3. If T : H →P(H)isδ-semimonotone for someδ (0,1), then T isρ-semimonotone for allρ ∈(δ,1).

Proof. Elementary.

Proposition 4. If T : H →P(H)(or T−1 : H P(H)) isδ-hypomonotone withδ∈(0,1/2), then T is-semimonotone. Moreover, if both T and T−1are

δ-hypomonotone withδ∈(0,1)then T isδ-semimonotone.

Proof. Elementary.

Remark 1. We mention that a δ-hypomonotone operator T with δ ≥ 1/2,

may fail to be ρ-semimonotone for all ρ, but the operator A= ρ

T is ρ

(6)

Proposition 5. An operator T : H →P(H)isρ-semimonotone if and only if kxy+u−vk2≥(1−ρ) kxyk2+ ku−vk2

, ∀(x,u), (y, v)∈G(T).

Proof. Elementary.

Proposition 6. If T : H →P(H)is maximalρ-semimonotone then its graph is closed (in the strong topology).

Proof. Elementary.

2.1 The one dimensional case

We study in this section ρ-semimonotone real valued functions, providing a

simple characterization that helps in the construction of a key example and also suggests the line to follow in order to study the general case.

Lemma 1. Givenρ ∈(0,1)defineθ (ρ)as

θ (ρ)=ρ−1p1−ρ2. (2)

A function f : XRRis ρ-semimonotone if and only if g : XR defined by g(x)= f(x)+ρ−1x satisfies

|g(x)−g(y)| ≥θ (ρ)|xy| (3)

for all x,yX , or equivalently, g−1 =(f +ρ−1I)−1is Lipschitz continuous with constantθ (ρ)−1.

Proof. Assume that f : XR is ρ-semimonotone and define g(x) = f(x)+ρ−1x. By Definition 2, for allx,y X

(xy)[f(x)− f(y)] ≥ −ρ

2 (xy)

2+ [f(x) f(y)]2 or, equivalently,

f(x)− f(y)

xy =

(xy)[f(x)− f(y)]

(xy)2

≥ −ρ

2 1+

f(x)− f(y)

xy

2!

.

(7)

Take any x 6= yX and definet = f(x)− f(y)

xy . Then, (4) is equivalent to t≥ −ρ2(1+t2), i.e.,

ρ

2t

2+t+ρ

2 ≥0 ⇐⇒ tt1=

−1−p1−ρ2

ρ or

tt2= −1+ p

1−ρ2

ρ ⇐⇒

t+ 1

ρ ≥ p

1−ρ2

ρ =θ (ρ).

Since for anyx 6= y,

f(x)− f(y)

xy +

1

ρ =

f(x)− f(y)

xy +

1

ρ ∙

xy xy =

g(x)−g(y)

xy ,

the proof is complete.

Example 1. Fix ρ ∈ (0,1), δ ≥ ρ−1p1−ρ2, and define g : RR as g(x)= −δx−1

3x

3. Then

g′(x)= −δ−x2 =⇒ g′(x)

=δ+x2≥δ

for allxR. Thus,gverifies (3). Hence, the function f :RRdefined

f(x)=g(x)− 1

ρx = −

δ+ 1

ρ

x−1

3x

3 (5)

is aρ-semimonotone function, in view of Lemma 1. On the other hand, the

function h(x) = f(x)+λx fails to be non-decreasing for all λ ∈ R, and

hence fI is not monotone, so that f fails to be λ-hypomonotone for all λ≥ 0. In connection with premonotonicity, note that, as an easy consequence

of Definition 1(v), ifT is point-to-point and pre-monotone, then

hT(x), x

kxk i ≥ − kT(0)k −σ (0) (6)

for all xRn\{0}. In the one-dimensional case, (6) entails that, for a

pre-monotoneT,T(x)is bounded from below on the positive half-line and bonded

from above in the negative half-line. It follows that f, as defined by (5), is not

(8)

semimonotone operators can be “very” decreasing, while hypomonotone or premonotone ones cannot. In a multidimensional setting, the operatorT :Rn→ Rn defined asT(x1, . . . ,x

n)= (f(x1), . . . , f(xn)), with f as in (5), provides an example of a nonlinearρ-semimonotone operator which fails to be both

pre-monotone andλ-hypomonotone for allλ≥0.

3 Prox-regularity properties

The surjectivity properties of TI for a ρ-semimonotone operator T are

related to its connection with the operator[TI]−1+γI, presented in the next theorem.

Theorem 2. Let I be the identity operator in H . Takeρ ∈(0,1)andβ, γ , η∈ R++as

β =β(ρ)= 1− p

1−ρ2

ρ , (7)

γ =γ (ρ)= ρ

2p 1−ρ2

, (8)

η=η(ρ)= 1

γ +β =

1+p1−ρ2

ρ . (9)

i) An operator T : H → P(H) is ρ-semimonotone if and only if the operator(TI)−1+γI is monotone.

ii) An operator T : H → P(H)is maximalρ-semimonotone if and only if the operator(TI)−1+γI is maximal monotone.

Proof. Consider A: H×HH ×H defined as A(x,u)=(u−γx, (1+

βγ )x−βu). It is elementary thatAis invertible, withA−1(x,u)=(u+βx, (1+

βγ )xu). Let(xˉ,uˉ)= A(x,u)andTˉ =(TI)−1+γI. We claim that

(x,u) ∈ G(Tˉ) if and only if(xˉ,uˉ) ∈ G(T). We proceed to prove the claim: (x,u)∈ G(Tˉ)iffu ∈(TI)−1(x)+γx iffxˉ =u−γx ∈ (TI)−1(x)

iffx ∈(TI)(xˉ)=T(xˉ)+βxˉ iffuˉ =x −βxˉ ∈T(xˉ)iff(xˉ,uˉ)∈G(T).

The claim is established and we proceed with the proof of (i). Consider pairs

(9)

A(y, v). Observe thatTˉ is monotone if and only if, for all(x,u), (y, v)∈G(Tˉ),

it holds that

0≤ hxy,u−vi

= h(uˉ+βxˉ)−(vˉ +βyˉ),[(1+γ β)xˉ +γuˉ] − [(1+γ β)yˉ+γvˉ]i

=(1+2γβ)h ˉx− ˉy,uˉ− ˉvi +(1+γ β)βk ˉx− ˉyk2+γk ˉu− ˉvk2,

(10)

using the definition of(xˉ,uˉ), (yˉ,v)ˉ and the formula of A−1in the first equality.

Note that the inequality in (10) is equivalent to

h ˉx − ˉy,uˉ− ˉvi ≥ −(1+γβ)β

1+2γ β k ˉx − ˉyk

2 γ

1+2γβk ˉu− ˉvk

2=

−ρ

2 k ˉx− ˉyk

2+ k ˉu− ˉvk2

,

(11)

using (7), (8) in the equality. In view of the claim above and the invertibility of

A,(xˉ,uˉ), (yˉ,v)ˉ coverG(T)when(x,u), (y, v)run overG(Tˉ). Thus, we

con-clude from (1) that the inequality in (11) is equivalent to theρ

-semimonotoni-city ofT.

We proceed now with the proof of (ii): In view of (i), if we can add a pair

(x,u) to G(Tˉ)while preserving the monotonicity of Tˉ, then we can add the

pair(xˉ,uˉ)= A(x,u)toG(T)and preserve theρ-semimonotonicity ofT, and

viceversa. It follows that the maximal monotonicity of Tˉ is equivalent to the

maximalρ-semimonotonicity ofT.

Corollary 1. If T : H →P(H)is maximalρ-semimonotone then the operator

(TI)−1+μI is onto for allμ > γ (ρ), whereγ (ρ)is given by(8).

Proof. By Theorem 2(ii), Tˉ = (TI)−1+γI, with β(ρ) as in (7), is

maximal monotone. Since

(TI)−1+μI = [(TI)−1+γI] +(μ−γ )I = ˉT +(μ−γ )I

andμ−γ >0, the result follows from Minty’s Theorem.

(10)

Proof. Fixβ(ρ), γ (ρ) andη(ρ)as in (7)-(9). Givenλ ∈ (β, η), defineμ =

(λ−β)−1 > 0. In view of (9),λ < η implies thatμ > γ. By Corollary 1, (TI)−1+μI is onto. Fix y H. We must exhibit somez H such that y∈(TI)(z). Since(TI)−1+μI is onto, there existsxH such that

μy

(TI)−1+μI

(x), or equivalently,μ(yx)∈(TI)−1(x), that

is to say,

x ∈(TI)[μ(yx)] (12)

Definez = μ(yx). In view of (12), yμ1z = x ∈ (TI)(z), which is

equivalent to

y

T +

β+ 1

μ

I

(z)=(TI)(z), (13)

in view of the definition of μ. It follows from (13) that the chosen z is an

appropriate one, thus establishing the surjectivity ofTI.

We prove next that ifT isρ-semimonotone then[TI]−1is point-to-point

and continuous for an apropriateλ.

Theorem 3. Letβ(ρ) andη(ρ)be given by(7) and(9)respectively. If T : H → P(H) is ρ-semimonotone then the operator (TI)−1 is Lipschitz

continuous for allλ∈(β(ρ), η(ρ)), with Lipschitz constant L(λ)given by

L(λ)= |1−ρλ| + p

1−ρ2

2λ−ρ(1+λ2) , (14)

and henceforth point-to-point.

Proof. Takeu, v ∈ H,x ∈(TI)−1(u)andy ∈(TI)−1(v). We must

prove that

kxyk ≤ L(λ)ku−vk. (15)

Note thatu−λxT(x),v−λyT(y), so that, applying Definition 2,

−ρ

2

kxyk2+ ku−v−λ(xy)k2≤

h(u−λx)−(v−λy),xyi = hu−v,xyi −λkxyk2.

(11)

Expanding the last term in the leftmost expression of (16) and rearranging, we get

h

λ−ρ

2 1+λ

2i

kxyk2−ρ

2ku−vk

2 ≤

(1−λρ)hu−v,xyi ≤ |1−λρ|ku−vkkxyk.

(17)

From the fact thatλ∈(β, η), it follows easily thatλ− ρ2(1+λ2) >0, so that,

takingu = v in (17), we obtain that x = y, and henceforth (15) holds when u=v. Otherwise, define

ω= kxyk ku−vk

and observe that the inequality in (17) is equivalent to

2λ−ρ 1+λ2ω2−2|1−λρ|ω−ρ ≤0. (18)

Again, the fact thatλ ∈ (β, η)guarantees that the coefficient ofω2 in the left

hand side of (18) is positive, so that (18) holds iffωbelongs to the interval whose

extrems are the two roots of the quadratic in the left hand side of (18), namely

ω1=

|1−ρλ| −p1−ρ2

2λ−ρ(1+λ2) , ω2=

|1−ρλ| +p1−ρ2

2λ−ρ(1+λ2) .

It is not hard to check thatω1 < 0 < ω2; the right inequality is immediate,

and the left one follows easily from the fact that λ belongs to (β(ρ), η(ρ)).

Sinceω = kxyk/ku−vkis positive, we conclude that (18) is equivalent to

ω ≤ ω2, which is itself equivalent to (15), in view of the definition of L(λ),

given in (14). The fact that(TI)−1is point-to-point is an immediate

conse-quence of (15).

Corollary 3. If T : H →P(H)isρ-semimonotone then the operator(T−1+

λI)−1is Lipschitz continuous for allλ (β(ρ), η(ρ)), with Lipschitz constant L(λ)given by(14). If in addition T is maximal, then T−1+λI is onto for all

λ∈(β(ρ), η(ρ)).

(12)

Remark 2. Note that limρ→1−β(ρ) = limρ1−η(ρ) = 1, and that

limρ→0+β(ρ) =0, limρ0+η(ρ)= +∞, so that the “regularity window” of a

ρ-semimonotone operatorT (i.e., the interval of values of λfor whichTI

is onto and its inverse is Lipschitz continuous), approaches the whole positive halfline whenρapproaches 0, i.e., whenT approaches plain monotonicity, and

reduces to a thin interval around 1 whenρ approaches 1 (remember that when ρ =1 the inequality in (1) holds for any operator T, meaning that no

“regular-ity window” can occur forρ =1).

Remark 3.Observe that

0< β(ρ) < ρ <1< 1

ρ < η(ρ)

for allρ ∈(0,1), so that 1,ρandρ−1always belong to the “regularity window”

of aρ-semimonotone operator T. We present next the values of the Lipschitz

constant L(λ)of(TI)−1 for the case in whichλtakes these three special values:

L(1)= 1

2 1+ s

1+ρ

1−ρ

!

, L(ρ)= 1

ρ 1+

1 p

1−ρ2

!

,

L

1

ρ

= p ρ

1−ρ2.

We state next that the characterization of semimonotonicity presented in Lemma 1 for the one dimensional case is a necessary condition for the gen-eral case.

Corollary 4. If T : H → P(H)isρ-semimonotone then the operator(T +

ρ−1I)−1is Lipschitz continuous with Lipschitz constant equal toθ (ρ)−1, where

θ (ρ)is given by(2).

Proof. The result follows from Theorem 3 and Remark 3 withλ=ρ−1.

A sufficient condition can be stated in terms of expansivity of T. We prove

(13)

η(ρ)as given by (9) (an assumption stronger than Lipschitz continuity of(T +

ρ−1I)−1with Lipschitz constant equal toθ (ρ)−1), thenT isρ-semimonotone.

Proposition 7. Take ρ ∈ (0,1). If T : H → P(H) is ν-expansive with

ν≥η(ρ), then T isρ-semimonotone.

Proof. FixuT(x)andv ∈ T(y), withx 6= y. Definet = ku−vk kxyk. Then

t ≥ν becauseT isν-expansive. Thereforett2= 1+ p

1−ρ2

ρ , wheret2is

the largest root of the quadraticρ 2t

2t+ρ

2, as in the proof of Lemma 1. Thus,

ρ

2 t

2

+1≥t=⇒ ρ

2 kxyk

2

+ ku−vk2≥ ku−vkkxyk ≥ −hxy,u−vi

for all x 6= y. Since the inequality in (1) is trivially valid when x = y, the

result holds.

REFERENCES

[1] A.N. Iusem, G. Kassay and W. Sosa, On certain conditions for the existence of solutions of equilibrium problems. Mathematical Programming, 116(2009), 259– 273.

[2] A.N. Iusem, G. Kassay and W. Sosa, An existence result for equilibrium problems with some surjectivity consequences. Journal of Convex Analysis,16(2009), 807– 826.

[3] A.N. Iusem and W. Sosa, New existence results for equilibrium problems. Nonlinear

Analysis,52(2002), 621–635.

[4] G. Minty, A theorem on monotone sets in Hilbert spaces. Journal of Mathematical

Analysis and Applications,11(1967), 434–439.

[5] T. Pennanen, Local convergence of the proximal point method and multiplier

Referências

Documentos relacionados

Computations of the currents of tidaI origin have shown that they are very smalI and of minor importance to the current conditions in the ChanneI, however

Therefore we are proposing a numerical procedure based on the fixed Newton idea that generates a sequence of approximate solutions of (2) at an affordable cost and thus

Additionally, the performances of both the trust-region dual and the primal-dual approaches were improved in an increasing pattern with the addi- tion of each suggested

Tables 2 and 3 report the name of the small and medium-size unconstrained optimization problems respectively, the number of function evaluations (Feval) used to reach the

According to Theorem 2.2 the following characterization of solutions for the extended problem formulation (CFOP ′ ) in the case of (− G , ( E ˆ , 3)) ˆ being convex-like can be

In [13], a Quasi Newton method based on the Broyden update formula and on a nonmonotone derivative-free line search was defined for the square case.. Under appropriate

The best way to achieve this goal is to apply a solvent-free, pH-neutral, hydrophobic adhesive resin layer in a separate step, as confirmed by inferior in vitro and in vivo

O primeiro aspecto é que as diferenças sexuais não podem ser vistas apenas como biologicamente determinadas na acepção meramente genital, antes, são social e