10.03.2015 Views

equilibrium problems with equilibrium constraints - Convex ...

equilibrium problems with equilibrium constraints - Convex ...

equilibrium problems with equilibrium constraints - Convex ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

10 Chapter 2 Mathematical Program <strong>with</strong> Equilibrium Constraints<br />

2.2 A Generalization of Scholtes’s Regularization<br />

In this section, we present a generalization of Scholtes’s regularization scheme [62].<br />

Our approach suggests relaxing the complementarity <strong>constraints</strong> and perturbing<br />

the coefficients in the objective function and <strong>constraints</strong> simultaneously. Hence,<br />

Scholtes’s scheme is a special case of our approach if the objective function and<br />

<strong>constraints</strong> are not perturbed. We show that the convergence analysis studied<br />

in [62] can be extended to our method <strong>with</strong>out any difficulty. The convergence<br />

results of our method will be applied to establish the convergence of the sequential<br />

nonlinear complementarity algorithm in the next section.<br />

For any mapping F : R n × A F → R m , where R n is the space of variables and<br />

A F is the space of (fixed) parameters, we denote the mapping as F(x; ā F ) <strong>with</strong><br />

x ∈ R n and ā F ∈ A F . The order of elements in ā F is mapping specific. For any<br />

positive sequence {t} tending to 0, we perturb the parameters in F and denote<br />

the new parameter vector as a F t <strong>with</strong> a F t → ā F as t → 0, and a F t = ā F when t = 0.<br />

Note that the perturbation on ā F does not require the perturbed vector a F t to be<br />

parameterized by t.<br />

To facilitate the presentation, we let Ω := {f, g, h, G, H} denote the collection<br />

of all the functions in the MPEC (2.1). With the notation defined above, the<br />

MPEC (2.1) is presented as<br />

minimize f(x; ā f )<br />

subject to g(x; ā g ) ≤ 0, h(x; ā h ) = 0,<br />

(2.10)<br />

0 ≤ G(x; ā G ) ⊥ H(x; ā H ) ≥ 0,<br />

where ā ω ∈ A ω , for all ω ∈ Ω.<br />

For any positive sequence {t} tending to 0, we perturb every parameter vector<br />

ā ω and denote the perturbed parameter vector as a ω t for all ω ∈ Ω. The perturbed<br />

vector a ω t should satisfy the following two conditions for all ω ∈ Ω:<br />

a ω t → ā ω , as t → 0 + . (2.11)<br />

a ω t = ā ω , when t = 0. (2.12)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!