• Keine Ergebnisse gefunden

On a generic class of regular one-parametric variational inequalities

N/A
N/A
Protected

Academic year: 2022

Aktie "On a generic class of regular one-parametric variational inequalities"

Copied!
29
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

On a generic class of regular one-parametric variational inequalities.

Gomez Boll, Walter

Institut fur Mathematik, Humboldt Universitat zu Berlin, Unter den Linden 6, D-10099, Berlin, Germany

Abstract

In this paper the regularity of one-parametric optimization prob- lems in the sense of Jongen, Jonker and Twilt is extended to one- parametric variational inequalities. The ve singularities are dened in this context and suitable indices are described around them. Many of the local properties of the singularities are also proved for this case.

The generic property of the dened class of regular one-parametric variational inequalities is proved and a corresponding linear quadratic perturbation result is stated.

Keywords: one-parametric variational inequalities, singularities, genericity

1 Introduction.

Let F : M !IRn be a mapping and M IRn be a closed set dened as M =fx2IRnjH(x) = 0 G(x)0g

where (H G) : IRn ! IRm+p. The variational inequality problem is dened as follows: Find some point x2M such that

F(x)(y;x)0 8y2M: (1)

1

(2)

This problem has found wide application as an adequate mathematical framework for a number of economic, game-theoretic and equilibrium prob- lems. For extensive surveys we cite e.g. 5] and 13].

Special cases of variational inequalities are for example equality systems (M = IRn), nonlinear complementarity problems (M = IRn+), and convex minimization problems (F =rf).

IfM is convex ( ;gj are convex and hi are ane linear) the solutions of the variational inequalities can be characterized, under constraint qualica- tion, by a suitable version of the well-know KKT-system. This convex case have been intensively studied and various reformulations of the variational inequality problem are given, for example as a system of equations (e.g. the normal map), as a generalized equation (via the normal cone) and as an optimization problem (constrained and unconstrained). Many of the solu- tion approaches proposed are very similar and base on the use of generalized Newton methods for nonsmooth equations (see e.g. 13], 5], 6], 3], 2], 8]).

A further approach was given recently (see e.g. 15], 18], 19] 17]), which base on the use of continuation methods. In this paper we are also interested in the application of such continuation techniques for the solution of varia- tional inequalities. Our main purpose is to extend the well-known regularity of one-parametric optimization problems in the sense of Jongen, Jonker and Twilt (see 11]) to the case of one-parametric variational inequalities. This regularity deals with the local structure of the solution sets of one-parametric optimization problems and is an important theoretical issue, for instance by the so called path-following methods with jumps (see e.g. 4]).

The paper is organized as follows. In the second section we redene the singularities, which characterize the regularity in the sense of Jongen, Jonker and Twilt, in the case of one-parametric varational inequalities and state the most important local properties. In the third section other properties are stated, for instance the generic character of the regular problems.

2 One-parametric variational inequalities.

Let us consider variational inequalities (F(x t) H(x t) G(x t)) depending of a one-dimensional real parametert. Such problems are dened by its data (F H G) : IRn+1 ! IRn+m+p and will also be denoted by V I(F H G). The corresponding feasible set M IRn+1 will also be denoted by M(H G).

Let us denotez = (x t)2IRn+1,I =f1 ::: mgand J =f1 ::: pg. For 2

(3)

a given parameter valuet the notation V I(F H G)(t) and M(H G)(t)IRn (or simply M(t)) state for the corresponding variational inequality and its feasible set.

Many well-known concepts from optimization theory concerning feasible sets apply also to variational inequalities, for instance constraint qualica- tions as LICQ or MFCQ, active index set, etc.

A feasible point z 2 M(H G) of the V I(F H G) is a critical point if there exist ( )2IRm+jJ0(z)j satisfying the following relation

L(z ) = 0 (2)

where L(z ) = F(z);Pmi=1iDxhi(z);Pj2J0(z)jDxgj(z). If j 0,

8j2J0(z) then z is called astationary point.

If the vectors fF(z) Dxhi(z) Dxgj(z) i2I j 2J0(z)g are linearly de- pendent, z is dened as a generalized critical point, shortly g.c. point (see 11]).

We consider in this paper mainly the sets

gc = nz 2IRn+1jz is a g:c: point of V I(F H G)o

stat = nz 2IRn+1jz is a stationary point of V I(F H G)o If necessary, the notation (F H G) will be used for recalling the data.

De nition 1

A g.c. point z of V I(F H G) is called non-degenerated if the LICQ holds and the following conditions are fullled:

VU-ND1

: The uniquely determined solution ( ) 2 IRm+jJ0(z)j of (2) satises j 6= 0 8j 2J0(z).

VU-ND2

: The matrix DxL(z )jTxM(t) is nonsingular.

Here TxM(t) is the tangential space to the set M(t) at the point x and DxL(z )jTxM(t) is a matrix of the form VTDxL(z )V , where the columns from V build a linear basis for TxM(t). In general, DxL(z ) is not symmetric. The signhdet(VTDxL(z )V )i is independent of the possible selection of V . Let us dene for K J the following mapping

HK(z ) =

0

B

@

F(z);Pmi=1iDxhi(z);Pj2KjDxgj(z) GH(z)K(z)

1

C

A: 3

(4)

Remark 1

Under the LICQ the Condition

VU-ND2

is equivalent to the regularity from D(x )HJ0(z ). The set of critical points is given locally under

VU-ND1

by the projection onto the z-components of the zeros of HJ0 and, therefore, due to the non-degeneracy it builts a smooth one-dimensional manifold that is parametrizable in t.

At a non-degenerated g.c. point theLI and LCI are uniquely determined (number of negative and positive entries of ). signhdet(DxL(z )jTxM(t))i is also uniquely determined. Around the dierent singularities we are then going to describe the changes of the triple

(LI LCI signhdet(DxL(z )jTxM(t))i) (3) Taking into account the relation

signhdet(DxL(z )jTxM(t))i=signhdet(D(x )HJ0(z ))i

we dene sign(det(DxL(z )jTxM(t))) = +1 for the case of TxM(t) =f0g.

2.1 Singulariti es and local properties.

A g.c. point z is of Type 1 if it is non-degenerated as in Denition 1.

Remark 2

In the neighbourhood of a g.c. point zof Type 1 the points of gc are non- degenerated and the triple (3) remain constant.

De nition 2

(see also 11])

A g.c. point zof V I(F H G) is of Type 2 if the following conditions hold:

Type2: 1-VU

: The LICQ is fullled

Type2: 2-VU

: Let ( )2 IRm+jJ0(z)j solve (2), then there exists exactly one index l 2J0(z), such that l = 0, and k 6= 0, 8k2J0(z)nf lg.

Type2: 3-VU

: DxL(z )jTxM(t) is nonsingular.

Type2: 4-VU

: DxL(z )jTx+M(t) is nonsingular, where Tx+M(t) =n 2IRnjDxH(z) = 0 DxGJ0+

(z)(z) = 0o and J0+(z) =fj 2J0(z)jl 6= 0g=J0(z)nflg.

4

(5)

Type2: 5-VU

: Let us denote

+ = (H GJ0+

(z))T, and

W is a matrix columns of which form a basis of Tx+M. It holds that 6= 0, where

= Dxgl(z)( + ) + Dtgl(z) = ;((Dx+(z))y)TDt+(z),

= ;W(WT DxLW);1WT DxL + DtL] and By = (BTB);1BT represent the Moore-Penrose Inverse of B. Denote by (xJ0+(t) t J0+(t) J0+(t)) (resp. (xJ0(t) t J0(t) J0(t))) a t- parametrization for the zeros of HJ0+ (resp. HJ0).

Remark 3

It is easy to see that, around z, the set gc is given by the curve (xJ0(t) t) and the feasible part of (xJ0+(t) t).

Type2: 4-VU

implies that the tangent lines of the two curves are not parallel.

For the description of the change from the triple (3) we use the charac- teristic numbers sign() and sign(), where

= det(DxL(z )jTxM(t))det(DxL(z )jTx+M(t)):

De nition 3

Let A be a matrix divided as follows A =

B C

D E

!

where B and E are quadratic. Let B be regular. The matrix S(AjB) = E;DB;1C is called the Schur-complement of B in A.

Lemma 1

(see 14])

Let A be as in Denition 3. Then it holds:

1. det(A) = det(E)det(S(AjB)):

2. If A is symmetric, it follows: In(A) = In(B) + In(S(AjB)). 5

(6)

3. If A is regular, its inverse is given by:

A;1=

B;1+B;1CS(AjB);1DB;1 ;B;1CS(AjB);1

;S(AjB);1DB;1 S(AjB);1

!

: Here In(P) = (p(P) n(P) z(P)) represents the so-called innertia triple of a symmetricquadratic matrixP, where p(P) (resp. n(P) and z(P)) means the number of positive (resp. negative or zero) eigenvalues of P.

Proposition 1

Let z be a g.c. point of Type 2 with vanishing multiplier l. It holds then that sign()sign() =;sign(_Jl0(t)) :

Proof :

Let the columns of the matrixV1build a basis forTxM(t) and the columns of V0 =V1...v1 one for Tx+M(t). It holds:

DxLjTx+M(t) =

V1TDxLV1 V1TDxLv1 v1TDxLV1 vT1DxLv1

!

:

Type2: 3-VU

implies the regularity of V1TDxLV1. Lemma 1 (1.-) gives that det(DxLjTx+M(t)) = det(DxLjTxM(t))det(S(DxLjTx+M(t)jDxLjTxM(t))) where

S(DxLjTx+M(t)jDxLjTxM(t)) = vT1DxLv1;

vT1DxLV1V1TDxLV1;1V1TDxLv1: Consequently, it holds:

sign() = signS(DxLjTx+M(t)jDxLjTxM(t)): (4) Since the derivatives of the components (H GJ0+) inHJ0+ andHJ0 coincide, it holds that _xJ0+(t);x_J0(t) 2Tx+M(t). Then there exists w0 with _xJ0+(t); x_J0(t) = V0w0. Multiplying the Jacobi-matrix of L from the left-hand side by V0 we obtain thatV0TDxLV0w0+ _Jl0(t)V0TDxgl(z) = 0: Consequently,

x_J0+(t);x_J0(t) =;_Jl0(t)V0V0TDxLV0;1V0TDTxgl(z): (5) 6

(7)

x x

t t

(a b c)

(a+1b;1c)

(a b;1c)

sign() = 1 sign() = 1 t t

(a b c)

(a;1b+1c)

(a;1b;c)

sign() = 1 sign() =;1 x

x

t t

(a b c)

(a;1b+1c)

(a;1b c)

sign() =;1 sign() = 1 t t

(a b c)

(a+1b;1c)

(a b;1;c)

sign() =;1 sign() =;1 Figure 1: Type 2

Since Dxgl(z)x_J0(t) + Dtgl(z) = 0, it follows that

= Dxgl(z)x_J0+(t) + Dtgl(z) = Dxgl(z)(_xJ0+(t);x_J0(t)):

Now (5) provides = ;_Jl0(t)Dxgl(z)V0V0TDxLV0;1V0TDTxgl(z): Since V0 =V1...v1, it follows that

=;_Jl0(t) 0...Dxgl(z)v1T

V1TDxLV1 V1TDxLv1 vT1DxLV1 vT1DxLv1

!

;1

0

v1TDTxgl(z)

!

: Lemma 1 and (4) together give:

=;_Jl0(t)Dxgl(z)vT12DxLjTx+M(t)jDxLjTxM(t)

;1: Substituting (4) in the above relation concludes the proof.

Using Proposition 1 we obtain the changes of the triple (3) as shown in Figure 1.

De nition 4

(see also 11])

A g.c. point zof V I(F H G) is of Type 3 if the following conditions hold:

7

(8)

Type3: 1-VU

: The LICQ is fullled.

Type3: 2-VU

:

VU-ND1

is fullled.

Type3: 3-VU

: DxL(z )jTxM(t) has rank n;m;jJ0(z)j;1.

Type3: 4-VU

: Let us denote

= (H GJ0(z)),

W is a matrix whose columns form a linear basis of TxM(t),

w1 6= 0 is a vector, with WTDxL(z )W w1= 0, v1 =W w1, and

w2 6= 0 is a vector, with WTDTxL(z )W w2 = 0, v2 =Ww2. It holds that 12 6= 0, where

1 = v1T(D2xLv2)v1;2vT1DTxL((DTx)y)T (v1TD2xv2)

;v2TDxL((DTx)y)T(vT1D2xv1), 2 = DtLv2;DTt(DTx)yDTxLv2 and the following notation is used:

v1T(Dx2Lv2)v1 =v1ThDx(DTxLv2)iv1T vT1Dx2v2 =v1TD2xhiv2 i2I v1TDx2gjv2 j 2J0T:

Remark 4

(see also 16])

Under the LICQ and

Type3: 3-VU

the condition

Type3: 4-VU

is equiv- alent to the non-degeneracy of the vector (z ) as a critical point of the optimization problem:

PV U min (z ) = t

(z )2XV U

XV U =n(z ) 2IRn+m+jJ0(z)j+1jHJ0(z ) = 0o:

Remark 5

gc is locally described by the projection ofXV U onto thez-components. Con- sequently, gc can be parametrized around zby one of the x-components, and the local structure is as shown in Figure 2.

8

(9)

x x

t t

(a b c)

(a b;c)

sign(12) = 1 t t

(a b c)

(a b;c)

sign(12) =;1 Figure 2: Type 3

In z the curve gc has a turning point in the variablet, since (z ) is a locally maximizer or minimizer of PV U. The position of the turning point z (t tas locally minimizer, the other t tas locally maximizer) depends directly on sign(12) (see Figure 2). It is easy to note that sign(1) and sign(12) are independent of the selected vectors v1 and v2 in

Type3: 4- VU

.

The linear indices remain locally constant along gc. The local changes of signhdet(DxL(z )jTxM(t))iare explained in Theorem 1 and in Remark 17.

De nition 5

(see also 11])

A g.c. point zof V I(F H G) is of Type 4 if the following conditions hold:

Type4: 1-VU

: 0< m +jJ0(z)j< n + 1.

Type4: 2-VU

: The matrix Dx

"

GJH(z)0(z)(z)

#

has rank m +jJ0(z)j;1.

Type4: 3-VU

: Let ( ) satisfying ( )Dx

"

GH(z)J0(z)(z)

#

= 0 be xed.

Then it holds that j 6= 0, 8j2J0(z).

Type4: 4-VU

: Dt

L

(z) 6= 0 and the matrix A = Dt

L

(z)WTDx2

L

(z)W is regular, where

L

(z) = Pi2I ihi(z) +Pj2J0(z)jgj(z) and the columns of W form a basis for the (n;m;J0(z)+1)-dimensional linear space

T =f 2IRnjDhi(z) = 0 Dgj(z) = 0 i 2I j 2J0(z)g 9

(10)

Type4: 5-VU

: FT(z)WA;1WTF(z) 6= 0.

Let us xl 2J0(z) and denote = (0 i j i2I j 2J0(z)nflg).

Remark 6

(see also 16])

If

Type4: 1-VU

,

Type4: 2-VU

and

Type4: 3-VU

are fullled, the conditions

Type4: 4-VU

and

Type4: 5-VU

together are equivalent to the following non-degeneracy:

The vector (z ), where = (0 j j 2J0(z)nl), is a non-degenerated critical point of the problem PeV U:

e

PV U min ~(z ) = t (z )2XfV U

f

XV U =n(z )2IRn+m+jJ0(z)j+1j;V U(z ) = 0o Here ;V U(z ) is dened by:

;V U(z ) =

0

B

@

0F(z);Pi2IiDxhi(z);Pj2J0(z)nflgjDxgj(z);lDxgl(z) H(z)

GJ0(z)(z)

1

C

A:

Remark 7

Since WTF(z)6= 0, the vectors

fF(z) Dxhi(z) Dxgj(z) i2I j 2J0(z)nfkgg (6) are linearly independent for arbitrary k 2 J0(z). Therefore, the projection of XfVU onto the z-components describes the set gc around z. XfV U can be parametrized with a smooth mapping (z() ()) dened around zero satis- fying (z(0) (0)) = (z ). From the LICQ it follows that _t(0) = 0 6= _0(0). Consequently, LICQ is fullled around z at each point of gc dierent from z. The linear indices change their values for < 0 and > 0, since the Lagrange-multipliers are given by 01

()(i() j() i2I j 2J0(z)nflg l).

Lemma 2

(see 12])

Let A be a symmetric(nn)-matrix and B an(nm)- matrix with rankm. If C =

A B

BT 0

!

it follows In(C) = In(CjKernBT) +In(m m m;m) . 10

(11)

HereKernBT =n 2IRnjBT = 0o and CjKernBT denotes a matrix of the form ~BTC ~B where the columns of ~B form a linear basis for KernBT.

Proposition 2

Let (z() ()) parametrize the curve XfV U around a g.c. point z of Type 4 with (z(0) (0)) = (z )). Then, for 6= 0, z() is a non-degenerated g.c.

point. signhdet(DxL(z())jTx( )M(t()))i is the same (or dierent) for > 0 and < 0 if and only if n;m;J0(z) is even (resp. odd).

Proof:

Letl 2J0(z) be xed. We use the following notations:

B0(z) = Dx

0

B

@

GJ0H(z)(z)nflg(z) FT(z)

1

C

A B1(z) = Dx

H(z)

GJ0(z)nflg(z)

!

and

L(z ) = 0F(z);Pi2IiDxhi(z);Pj2J0(z)nflgjDxgj(z);lDxgl(z):

Let W0(z) be dened in a neighbourhood Uz of z such that its columns form a linear basis for KernB0(z). W0(z) can be choosen depending from z as smooth as B0(z). Let the columns of a matrix W1 = W0(z)...b0 form a basis for KernB1(z).

Consider near zero with z() 2 Uz. The columns of W0(z()) form then a basis for Tx()M(t()) and, since LICQ and

VU-ND1

are fullled by Remark 7, the non-degeneracy of z() holds if W0T(z())DxL(z())W0(z()) is regular, where DxL(z()) = 0(1)DxL(z() ()): Consequently, it is su- cient to show the regularity of

W0T(z(0))DxL(z(0) (0))W0(z(0)) =;W0T(z)D2x

L

(z)W0(z) (7) where

L

(z) is intended as in Denition 5. The equation

det(W0T(z())DxL(z())W0(z())) =01( )

(n;m;J0(z))det(W0T(z())DxL(z()())W0(z())) explains the changes of signhdet(DxL(z())jTx( )M(t()))i. (8)

Using Lemma 2 we obtain that the matrix (7) is regular if and only if

0

B

@

Dx2

L

(z) B1(z) F(z) B1T(z) 0 0 FT(z) 0 0

1

C

A (9)

11

(12)

is so, too, and that the submatrix

D2x

L

(z) B1(z) B1T(z) 0

!

is regular, since A (as in Denition 5) is nonsingular. From Lemma 1 the regularity of (9) is obtained if

FT(z) 0

Dx2

L

(z) B1(z) B1T(z) 0

!

;1

F(z) 0

!

6= 0:

However the above number is equal to FT(z)W1hW1TDx2

L

(z)W1i;1W1TF(z) and the proof is concluded by using

Type4: 5-VU

.

Remark 8

x(0)_ 6= 0, since the vectors (6) are linearly independent and _t(0) = 0. gc is then parametrizable aroundzwith respect to an x-component (see Figure 3).

Around z gc has a turning point in t, since (z ) is a non-degenerated stationary point of PeV U. The geometric position of the turning point is determined by the number

D2(z )L(z )jT(z)XeV U = ;1

Dt

L

(z)FT(z)W hWTD2x

L

(z)Wi;1WTF(z) where L is the Lagrange-function corresponding to PeV U and W is intended as in Denition 5.

Sincesign(D2(z )L(z )jT(z)XeV U) =;sign(FT(z)WA;1WTF(z)), we can use = sign(FT(z)WA;1WTF(z)) for the characterization of the geometric position of the curve gc (see Figure 3).

Finally sign() = (;1)n;m;J0(z) determines according to Proposition 2 the changes of signhdet(DxL(z())jTx( )M(t()))i.

Remark 9

Let us consider a point zof Type 4 in the case that the sets M(t)are convex (hi linear ane and then J0(z)6=). Let(z() ())be a parametrization as in the above Proposition 2, and such that z()is a stationary point for < 0. It follows that every j j 2 J0(z), in Denition 5 has the same sign (i.e., the MFCQ is not fullled). Let us x then j > 0 8j 2J0(z). It follows that 0() > 0 for < 0.

The LICQ holds for < 0 and the convexity of M(t()) implies that D2xgj(z()) j 2J0(z), are negative semidenite on Tx()M(t()). Therefore,

12

(13)

x x

t t

(a b c)

(b a c)

sign() = 1 sign() = 1 t t

(a b c)

(b a c)

sign() = ;1 sign() = 1 x

x

t t

(a b c)

(b a;c)

sign() = 1 sign() =;1 t t

(a b c)

(b a;c)

sign() =;1 sign() =;1 Figure 3: Type 4

W0TD2x

L

(z)W0 is negative semidenite, where W0 is intended as in the proof of the above Proposition 2 and

L

as in Denition 5. Since W0TD2x

L

(z)W0 is regular, it is then negative denite, and signhdet(;W0TD2x

L

(z)W0)i = +1. The relations (7) and (8) imply then that signhdet(DxL(z())jTx( )M(t()))i= +1 for < 0.

On the other hand, WTD2x

L

(z)W, where W is intended as in Denition 5, has at most one positive eigenvalue. Applying the results from Theorem 5.3 (cases 2. and 3.) in 10] about the homotopic changes of parametric feasible sets it follows that WTDx2

L

(z)W must be negative denite and that M(t), by passing the parameter value t, vanishes or is created.

De nition 6

(see also 11])

A g.c. point zof V I(F H G) is of Type 5 if the following conditions hold:

Type5: 1-VU

: m +jJ0(z)j=n + 1.

Type5: 2-VU

: The matrix D

"

GH(z)J0(z)(z)

#

has rank n + 1.

Type5: 3-VU

: It holds

Type4: 3-VU (

( ) are xed

)

. 13

(14)

Type5: 4-VU

: Let ( )2IRm IRjJ0(z)j solve the system

F(z) 0

!

; X

i2IiDThi(z); X

j2J0(z) jDTgj(z) = 0:

Then jk 6= 0, 8j k 2J0(z), j 6=k, where jk = j ; k j k.

Remark 10

From

Type5: 1-VU

,

Type5: 2-VU

and

Type5: 3-VU

it follows that each g.c. point in a neighbourhood ofzsolves (with corresponding multipliers) one of the systems

HJ0(z)nfkg(z ) = 0 (10) where k2J0(z).

For each k 2 J0(z) there exists a parametrization (xk(t) t k(t) k(t)) around (z k k) of the solution set from (10), with (xk(t) t k(t) k(t)) = (z k k).

Remark 11

gc is described aroundzby the union of the feasible parts of the n+1 curves (xk(t) t). It also holds that dtdgk(xk(t) t) = DTxgk(z)_xk(t) + Dtgk(z) 6= 0 for k 2J0(z). Since DTxgk1(z)_xk2(t)+Dtgk1(z) = 0, it follows thatx_k1(t)6= _xk2(t) for k1 6=k2 (see Figure 4).

Remark 12

(see 11])

If the MFCQ fails to hold in z, then every k has the same sign. Then each curve belonging to gc runs in the samet-direction. Therefore, zis a turning point from gc. Analogously as for optimization problems it holds that stat

around zconsists of only one curve (xk(t) t)and zis a border point ofstat. If the MFCQ is fullled andzis a stationary point, then there exist exactly two curves (xk1(t) t)and (xk2(t) t) consisting of stationary points and with opposite t-directions. Hence, stat has a continuation.

The local structure of the sets gc and stat around a point of Type 5 is shown in gure 4.

Remark 13

If the M(t) are convex (hi ane and J0(z) 6=, since jIj<= n) Theorems 4.1 (Type 3 and 4) and 5.3 (cases 2. and 3.) in 10] imply that the feasible set M(t)in the parameter value tvanishes or appears when the MFCQ is not fullled.

14

(15)

z z MFCQ is

violated at z

z holds at MFCQz

t x

t

x gcnstat

stat

Figure 4: Typ 5

3 Some properties of regular one-parametric variational inequalities.

3.1 The points of Type 3.

In this section we prove a basic result similar to Theorem 10.2.2 in 9]. Let q n be xed and consider mappings with the structure

T(x u t) =

T1(x u t) T2(x t)

!

(11) where x 2 IRn, u 2 IRq, T : IRn+q+1 ! IRn+q, T1 : IRn+q+1 ! IRn and therefore T2 :IRn+1 !IRq. Let us consider two matrices,BL =

C1 C2 0 Iq

!

and BR =

C3 0 C4 Iq

!

, where C1 and C2 are quadratic regular matrices with size n, and Iq states for the identity matrix of size q. BL and BR are then quadratic and regular.

By T(BLBR)(y v t) = BLT(BR(y v) t) =

T(1BLBR)(y v t) T(2BLBR)(y t)

!

let us denote another mapping. From the structure of BL and BR it follows that

15

(16)

T(BLBR) has the same dependence on its variables as T (pointed out by the notations T(1BLBR) and T(2BLBR)). It holds that T(x u t) = 0 if and only if T(BLBR)(BR;1(x u) t) = 0. If we dene (T) =f(x u t)jT(x u t) = 0g it follows that

(T) =

BR 0 0 1

!

(T(BLBR)): (12) Let us consider the following assumption for a mappingT(x u t).

P1(T) : 0 is a regular value of T

Remark 14

The relation

DT(BLBR))(y v t) = BLDT(BR(y v) t)

BR 0 0 1

!

(13) implies that P1(T)holds if and only if P1(T(BLBR)) holds, too.

Let us dene s(T) =n(x u t)2(T)jdet(D(x u)T(x u t)) = 0o:

Proposition 3

Let (x u t) 2 s(T) and (y v t) 2 s(T(BLBR)) be xed with (x u) = BR

(y v). Let P1(T) (and also P1(T(BLBR))) be fullled around (x u t) (resp.

(y v t)). Then, (x u t) is a non-degenerated critical point of tj(T) if and only if (y v t) is a non-degenerated critical point of tj(T(BLBR)).

Heretj(T)(analogously totj(T(BLBR))) represents the optimization prob- lem with the objective function F(x u t) = t and the feasible set (T).

Proposition 3 is proved easily writting down booth conditions.

Remark 15

Let P1(T) be fullled and (y() v() t()) be a local parametrization of the curve(T(BLBR))around(y v t)2s(T(BLBR)), which is dened in a neigh- bourhood of zero and (y(0) v(0) t(0)) = (y v t). By (12) the mapping

0

B

@

x()u() t()

1

C

A=

BR 0 0 1

! 0

B

@

y()v() t()

1

C

A

is also a local parametrization of (T) around (x u t). 16

Referenzen

ÄHNLICHE DOKUMENTE

The two main results are that rules cluster satisfactorily in the two-parameter diagram according to their Wolfram Class 7(a) , and that the diagram can explain the

Universidad Autonoma de Nuevo Leon, University of Texas at El Paso. 10

In the last Section, we use his mass formula and obtain a list of all one- class genera of parahoric families in exceptional groups over number fields.. Then k is

semi-parametric estimation method for the binary choice model: Probit. Maximum Likelihood versus

When Dom V is not compact, we shall prove by approximation that assumption (11) is sufficient for the existence of a solution to inequalities (20) iii).. The

Keywords : parametric optimization, pathfollowing methods, jumps, gen- eralized critical point, turning point in the negative sense...

In each case a discrete Lagrange multiplier is designed, which is efficient in the sense of Theorem B (with the exception of CFEM for the Bingham problem) and allows for a

In parametric transmission systems, a low frequency acoustic wave with a high directivity and a high rela- tive bandwidth is generated by making use of the non- linear wave