lecture. - CASTLE Lab - Princeton University
lecture. - CASTLE Lab - Princeton University
lecture. - CASTLE Lab - Princeton University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Perturbation Theorems<br />
Theorem 2[Shapiro, Dentcheva, and Ruszczyński(2009)]<br />
Under all the assumptions we have made in the previous two slides, for t ≥ 0,<br />
we have the second-order expansion of the optimal function<br />
v(t) = ¯v +tηt(¯x)+ t2<br />
2 hf,η(¯x)+o(t 2 ),<br />
where hf,η(¯x) is the optimal value of the auxiliary problem over h,<br />
minimize 2h ⊤ ∇η(¯x)+h ⊤ ∇ 2 f(¯x)h<br />
subject to h ∈ C crit (¯x) := {d ∈ TC(¯x) : d ⊤ ∇f(¯x) = 0},<br />
TC(x) := {c ∈ R n : dist(x +td,C) = o(t),t ≥ 0}.<br />
Moreover, if the solution to the auxiliary problem is a unique, say ¯g, we have for<br />
t ≥ 0 the first-order expansion of the optimal solution<br />
˜x(t) = ¯x +t ¯ h+o(t).<br />
Boris Defourny (ORFE) Lecture 6: Perturbation Analysis in Optimization March 15,2012 26 / 26