In mathematical optimization, the perturbation function is any function which relates to primal and dual problems. The name comes from the fact that any such function defines a perturbation of the initial problem. In many cases this takes the form of shifting the constraints. In some texts the value function is called the perturbation function, and the perturbation function is called the bifunction.
Definition Given two dual pairs of separated locally convex spaces ( X , X ∗ ) {\displaystyle \left(X,X^{*}\right)} and ( Y , Y ∗ ) {\displaystyle \left(Y,Y^{*}\right)} . Then given the function f : X → R ∪ { + ∞ } {\displaystyle f:X\to \mathbb {R} \cup \{+\infty \}} , we can define the primal problem by
inf x ∈ X f ( x ) . {\displaystyle \inf _{x\in X}f(x).\,}
If there are constraint conditions, these can be built into the function f {\displaystyle f} by letting f ← f + I c o n s t r a i n t s {\displaystyle f\leftarrow f+I_{\mathrm {constraints} }} where I {\displaystyle I} is the characteristic function. Then F : X × Y → R ∪ { + ∞ } {\displaystyle F:X\times Y\to \mathbb {R} \cup \{+\infty \}} is a perturbation function if and only if F ( x , 0 ) = f ( x ) {\displaystyle F(x,0)=f(x)} .
Use in duality The duality gap is the difference of the right and left hand side of the inequality
sup y ∗ ∈ Y ∗ − F ∗ ( 0 , y ∗ ) ≤ inf x ∈ X F ( x , 0 ) , {\displaystyle \sup _{y^{*}\in Y^{*}}-F^{*}(0,y^{*})\leq \inf _{x\in X}F(x,0),}
where F ∗ {\displaystyle F^{*}} is the convex conjugate in both variables. For any choice of perturbation function F weak duality holds. There are a number of conditions which if satisfied imply strong duality. For instance, if F is proper, jointly convex, lower semi-continuous with 0 ∈ core ( Pr Y ( dom F ) ) {\displaystyle 0\in \operatorname {core} ({\Pr }_{Y}(\operatorname {dom} F))} (where core {\displaystyle \operatorname {core} } is the algebraic interior and Pr Y {\displaystyle {\Pr }_{Y}} is the projection onto Y defined by Pr Y ( x , y ) = y {\displaystyle {\Pr }_{Y}(x,y)=y} ) and X, Y are Fréchet spaces then strong duality holds.
Examples
Lagrangian Let ( X , X ∗ ) {\displaystyle (X,X^{*})} and ( Y , Y ∗ ) {\displaystyle (Y,Y^{*})} be dual pairs. Given a primal problem (minimize f(x)) and a related perturbation function (F(x,y)) then the Lagrangian L : X × Y ∗ → R ∪ { + ∞ } {\displaystyle L:X\times Y^{*}\to \mathbb {R} \cup \{+\infty \}} is the negative conjugate of F with respect to y (i.e. the concave conjugate). That is the Lagrangian is defined by
L ( x , y ∗ ) = inf y ∈ Y { F ( x , y ) − y ∗ ( y ) } . {\displaystyle L(x,y^{*})=\inf _{y\in Y}\left\{F(x,y)-y^{*}(y)\right\}.}
In particular the weak duality minmax equation can be shown to be
… excerpt ends here. Continue reading the full article.
