# Complementarity problem

### From Wikimization

(New page: == An application to nonlinear complementarity problems == === Fixed point problems === Let <math>\mathcal A</math> be a set and <math>F:\mathcal A\to\mathcal A </math> a mapping. The ''...) |
Current revision (13:16, 29 June 2015) (edit) (undo) (→Remark) |
||

(169 intermediate revisions not shown.) | |||

Line 1: | Line 1: | ||

- | + | [http://web.mat.bham.ac.uk/S.Z.Nemeth/ <math>-</math> Sándor Zoltán Németh] | |

- | === Fixed point problems == | + | (In particular, we can have <math>\mathbb{H}=\mathbb{R}^n</math> everywhere in this page.) |

- | + | == Fixed point problems == | |

- | Let <math>\mathcal A</math> be a set and <math> | + | Let <math>\mathcal{A}</math> be a set and <math>T:\,\mathcal{A}\to\mathcal{A} </math> a mapping. The '''fixed point problem''' defined by <math>T\,</math> is the problem |

<center> | <center> | ||

<math> | <math> | ||

- | Fix( | + | Fix(T):\,\left\{ |

\begin{array}{l} | \begin{array}{l} | ||

- | Find | + | \textrm{Find }x\in\mathcal{A}\textrm{ such that}\\\\\\ |

- | + | x=T(x). | |

\end{array} | \end{array} | ||

\right. | \right. | ||

Line 16: | Line 16: | ||

</center> | </center> | ||

- | + | == Nonlinear complementarity problems == | |

- | + | Let <math>\mathcal{K}</math> be a closed convex cone in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>F:\,\mathbb{H}\to\mathbb{H}</math> a mapping. Recall that the dual cone of <math>\mathcal{K}</math> is the closed convex cone <math>\mathcal{K}^*=-\mathcal{K}^\circ</math> where <math>\mathcal{K}^\circ</math> is the [[Moreau's_decomposition_theorem#Moreau.27s_theorem |polar]] of <math>\mathcal{K}.</math> The '''nonlinear complementarity problem''' defined by <math>\mathcal{K}</math> and <math>f\,</math> is the problem | |

- | Let <math>\mathcal K</math> be a closed convex cone in the Hilbert space <math>(\mathbb H,\langle\cdot,\cdot\rangle)</math> and <math> | + | |

<center> | <center> | ||

<math> | <math> | ||

- | NCP( | + | NCP(F,\mathcal{K}):\,\left\{ |

\begin{array}{l} | \begin{array}{l} | ||

- | Find | + | \textrm{Find }x\in\mathcal{K}\textrm{ such that}\\\\\\ |

- | + | F(x)\in\mathcal{K}^*\textrm{ and }\langle x,F(x)\rangle=0. | |

\end{array} | \end{array} | ||

\right. | \right. | ||

Line 31: | Line 30: | ||

</center> | </center> | ||

- | + | == Every nonlinear complementarity problem is equivalent to a fixed point problem == | |

- | + | Let <math>\mathcal{K}</math> be a closed convex cone in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>F:\,\mathbb{H}\to\mathbb{H}</math> a mapping. Then the [[Complementarity_problem#Nonlinear_complementarity_problems | nonlinear complementarity problem]] | |

- | Let <math>\mathcal K</math> be a closed convex cone in the Hilbert space <math>(\mathbb H,\langle\cdot,\cdot\rangle)</math> and <math> | + | <math>NCP(F,\mathcal{K})</math> is equivalent to the [[Complementarity_problem#Fixed_point_problems | fixed point problem]] |

- | <math>Fix(P_{\mathcal K}\circ(I- | + | <math>Fix(P_{\mathcal{K}}\circ(I-F))</math> where <math>I:\,\mathbb{H}\to\mathbb{H}</math> is the identity mapping defined by <math>I(x)=x\,</math> and <math>P_{\mathcal{K}}</math> is the [[Moreau's_decomposition_theorem#Projection_on_closed_convex_sets | projection onto <math>\mathcal{K}.</math>]] |

=== Proof === | === Proof === | ||

- | + | For all <math>x\in\mathbb{H}</math> denote <math>z=x-F(x)\,</math> and <math>y=-F(x).\,</math> Then <math>z=x+y.\,</math> | |

- | For all <math>x\in\mathbb H</math> denote <math>z=x- | + | |

<br> | <br> | ||

<br> | <br> | ||

- | Suppose that <math>x\,</math> is a solution of <math>NCP( | + | Suppose that <math>x\,</math> is a solution of <math>NCP(F,\mathcal{K}).</math> Then <math>z=x+y\,</math> with <math>x\in\mathcal{K},</math> |

+ | <math>y\in\mathcal{K}^\circ,</math> and <math>\langle x,y\rangle=0.</math> Hence, via [[Moreau's_decomposition_theorem#Moreau.27s_theorem|Moreau's theorem]], we get <math>x=P_{\mathcal{K}}z.</math> Therefore <math>x\,</math> is a solution of <math>Fix(P_{\mathcal{K}}\circ(I-F)).</math> | ||

<br> | <br> | ||

<br> | <br> | ||

- | Conversely, suppose that <math>x\,</math> is a solution of <math>Fix(P_{\mathcal K}\circ(I- | + | Conversely, suppose that <math>x\,</math> is a solution of <math>Fix(P_{\mathcal{K}}\circ(I-F)).</math> Then <math>x\in\mathcal{K}</math> and via [[Moreau's_decomposition_theorem#Moreau.27s_theorem | Moreau's theorem]] |

<center> | <center> | ||

- | <math>z=P_{\mathcal K}(z)+P_{\mathcal K^\circ}(z)=x+P_{\mathcal K^\circ}(z).</math> | + | <math>z=P_{\mathcal{K}}(z)+P_{\mathcal{K}^\circ}(z)=x+P_{\mathcal{K}^\circ}(z).</math> |

</center> | </center> | ||

- | Hence | + | Hence <math>P_{\mathcal{K}^\circ}(z)=z-x=y,</math> thus <math>y\in\mathcal{K}^\circ.</math> [[Moreau's_decomposition_theorem#Moreau.27s_theorem | Moreau's theorem]] also implies that <math>\langle x,y\rangle=0.</math> In conclusion, |

- | <math>x\in\mathcal K,</math> <math> | + | <math>x\in\mathcal{K},</math> <math>F(x)=-y\in\mathcal{K}^*,</math> and <math>\langle x,F(x)\rangle=0.</math> Therefore <math>x\,</math> is a solution of <math>NCP(F,\mathcal{K}).</math> |

=== An alternative proof without [[Moreau's_decomposition_theorem#Moreau.27s_theorem | Moreau's theorem]] === | === An alternative proof without [[Moreau's_decomposition_theorem#Moreau.27s_theorem | Moreau's theorem]] === | ||

==== Variational inequalities ==== | ==== Variational inequalities ==== | ||

- | + | Let <math>\mathcal{C}</math> be a closed convex set in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>F:\,\mathbb{H}\to\mathbb{H}</math> a mapping. The '''variational inequality''' defined by <math>\mathcal{C}</math> and <math>F\,</math> is the problem | |

- | Let <math>\mathcal C</math> be a closed convex set in the Hilbert space <math>(\mathbb H,\langle\cdot,\cdot\rangle)</math> and <math> | + | |

<center> | <center> | ||

<math> | <math> | ||

- | VI( | + | VI(F,\mathcal{C}):\,\left\{ |

\begin{array}{l} | \begin{array}{l} | ||

- | Find | + | \textrm{Find }x\in\mathcal{C}\textrm{ such that}\\\\\\ |

- | \langle y-x, | + | \langle y-x,F(x)\rangle\geq 0,\textrm{ for all }y\in\mathcal{C}. |

\end{array} | \end{array} | ||

\right. | \right. | ||

Line 72: | Line 70: | ||

</center> | </center> | ||

- | ==== | + | ===== Remark ===== |

+ | The next result is not needed for the alternative proof and it can be skipped. However, it is an important property in its own. It was included for the completeness of the ideas. | ||

- | Let <math>\mathcal C</math> be a closed convex set in the Hilbert space <math>(\mathbb H,\langle\cdot,\cdot\rangle)</math> and <math> | + | ==== Every fixed point problem defined on closed convex set is equivalent to a variational inequality ==== |

+ | Let <math>\mathcal{C}</math> be a closed convex set in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>T:\,\mathcal{C}\to\mathcal{C}</math> a mapping. Then the [[Complementarity_problem#Fixed_point_problems | fixed point problem]] <math>Fix(T)\,</math> is equivalent to the [[Complementarity_problem#Variational_inequalities | variational inequality]] <math>VI(F,\mathcal{C}),</math> where <math>\,F=I-T.</math> | ||

- | ==== Proof ==== | + | ===== Proof ===== |

+ | Suppose that <math>x\,</math> is a solution of <math>Fix(T)\,</math>. Then, | ||

+ | <math>F(x)=0\,</math> and thus <math>x\,</math> is a solution of <math>VI(F,\mathcal{C}).</math> | ||

+ | |||

+ | Conversely, suppose that <math>x\,</math> is a solution of <math>VI(F,\mathcal{C})</math> and | ||

+ | let <math>\,y=T(x).</math> Then, <math>\left\langle y-x,F(x)\right\rangle\geq 0,</math> which is | ||

+ | equivalent to <math>-\parallel x-T(x)\parallel^2=0.</math> Hence, <math>\,x=T(x)</math>; that is, <math>x\,</math> is a solution of <math>Fix(T)\,</math>. | ||

+ | |||

+ | ==== Every variational inequality is equivalent to a fixed point problem ==== | ||

+ | Let <math>\mathcal{C}</math> be a closed convex set in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>F:\,\mathbb{H}\to\mathbb{H}</math> a mapping. Then the [[Complementarity_problem#Variational_inequalities | variational inequality]] <math>VI(F,\mathcal{C})</math> is equivalent to the [[Complementarity_problem#Fixed_point_problems | fixed point problem]] <math>Fix(P_{\mathcal{C}}\circ(I-F)).</math> | ||

- | <math>x\,</math> is a solution of <math>Fix(P_{\mathcal C}\circ(I- | + | ===== Proof ===== |

- | <math>x=P_{\mathcal C}(x- | + | <math>x\,</math> is a solution of <math>Fix(P_{\mathcal{C}}\circ(I-F))</math> if and only if |

+ | <math>x=P_{\mathcal{C}}(x-F(x)).</math> Via [[Moreau's_decomposition_theorem#Characterization_of_the_projection|characterization of the projection]], the latter equation is equivalent to | ||

<center> | <center> | ||

- | <math>\langle x- | + | <math>\langle x-F(x)-x,y-x\rangle\leq0</math> |

</center> | </center> | ||

- | for all <math>y\in\mathcal C.</math> But this holds if and only if <math>x\,</math> is a solution | + | for all <math>y\in\mathcal{C}.</math> But this holds if and only if <math>x\,</math> is a solution |

- | + | to <math>VI(F,\mathcal{C}).</math> | |

===== Remark ===== | ===== Remark ===== | ||

- | + | The next section shows that the equivalence of [[Complementarity_problem#Variational_inequalities | variational inequalities]] and [[Complementarity_problem#Fixed_point_problems | fixed point problems]] is much stronger than the equivalence of [[Complementarity_problem#Nonlinear_complementarity_problems |nonlinear complementarity problems]] and [[Complementarity_problem#Fixed_point_problems | fixed point problems]] because each [[Complementarity_problem#Nonlinear_complementarity_problems |nonlinear complementarity problem]] is a [[Complementarity_problem#Variational_inequalities | variational inequality]] defined on a closed convex cone. | |

- | The next section shows that the equivalence of variational inequalities and fixed point problems is much stronger than the equivalence of nonlinear complementarity problems and fixed point problems | + | |

==== Every variational inequality defined on a closed convex cone is equivalent to a complementarity problem ==== | ==== Every variational inequality defined on a closed convex cone is equivalent to a complementarity problem ==== | ||

+ | Let <math>\mathcal{K}</math> be a closed convex cone in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>F:\,\mathbb{H}\to\mathbb{H}</math> a mapping. Then the [[Complementarity_problem#Nonlinear_complementarity_problems | nonlinear complementarity problem]] | ||

+ | <math>NCP(F,\mathcal{K})</math> is equivalent to the [[Complementarity_problem#Variational_inequalities | variational inequality]] | ||

+ | <math>VI(F,\mathcal{K}).</math> | ||

- | + | ===== Proof ===== | |

- | + | Suppose that <math>x\,</math> is a solution of <math>NCP(F,\mathcal{K}).</math> Then <math>x\in\mathcal{K},</math> <math>F(x)\in\mathcal{K}^*,</math> and <math>\langle x,F(x)\rangle=0.</math> Hence | |

- | ==== Proof ==== | + | |

- | + | ||

- | Suppose that <math>x\,</math> is a solution of <math>NCP( | + | |

<center> | <center> | ||

- | <math>\langle y-x, | + | <math>\langle y-x,F(x)\rangle\geq 0</math> |

</center> | </center> | ||

- | for all <math>y\in\mathcal K.</math> Therefore | + | for all <math>y\in\mathcal{K}.</math> Therefore <math>x\,</math> is a solution of <math>VI(F,\mathcal{K}).</math> |

<br> | <br> | ||

<br> | <br> | ||

- | Conversely, suppose that <math>x\,</math> is a solution of <math>VI( | + | Conversely, suppose that <math>x\,</math> is a solution of <math>VI(F,\mathcal{K}).</math> Then |

- | <math>x\in\mathcal K</math> and | + | <math>x\in\mathcal{K}</math> and |

<center> | <center> | ||

- | <math>\langle y-x, | + | <math>\langle y-x,F(x)\rangle\geq 0</math> |

</center> | </center> | ||

- | for all <math>y\in\mathcal K.</math> | + | for all <math>y\in\mathcal{K}.</math> Choosing <math>y=0\,</math> and <math>y=2x,\,</math> in particular, we get a system of two inequalities that demands <math>\langle x,F(x)\rangle=0.</math> Thus <math>\langle y,F(x)\rangle\geq 0</math> for all <math>y\in\mathcal{K};</math> equivalently, <math>F(x)\in\mathcal{K}^*.</math> In conclusion, <math>x\in\mathcal{K},</math> <math>F(x)\in\mathcal{K}^*,</math> and <math>\langle x,F(x)\rangle=0.</math> Therefore <math>x\,</math> is a solution to <math>NCP(F,\mathcal{K}).</math> |

==== Concluding the alternative proof ==== | ==== Concluding the alternative proof ==== | ||

+ | Since <math>\mathcal{K}</math> is a closed convex cone, the [[Complementarity_problem#Nonlinear_complementarity_problems | nonlinear complementarity problem]] <math>NCP(F,\mathcal{K})</math> is equivalent to the [[Complementarity_problem#Variational_inequalities | variational inequality]] <math>VI(F,\mathcal{K})</math> which [[Complementarity_problem#Every_variational_inequality_is_equivalent_to_a_fixed_point_problem | is equivalent to]] the [[Complementarity_problem#Fixed_point_problems | fixed point problem]] <math>Fix(P_{\mathcal{K}}\circ(I-F)).</math> | ||

- | + | == Another fixed point problem providing solutions for variational inequalities and complementarity problems == | |

- | = | + | Let <math>\mathcal{C}</math> be a closed convex set in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle),</math> |

- | + | <math>I:\,\mathbb{H}\to\mathbb{H}</math> the identity mapping defined by <math>I(x)=x</math> and <math>F:\,\mathbb{H}\to\mathbb{H}</math> a mapping. Then, for any solution <math>x\,</math> of the fixed point problem <math>Fix({(I-F)\circ P_{\mathcal{C}}}),</math> the projection <math>P_{\mathcal{C}}(x)</math> of <math>x\,</math> onto <math>\mathcal{C}</math>is a solution of the variational inequality <math>VI(F,\mathcal{C}).</math> | |

- | Let <math>\mathcal K</math> be a closed convex cone in the Hilbert space <math>(\mathbb H,\langle\cdot,\cdot\rangle)</math> and <math> | + | === Proof === |

+ | Since <math>x\,</math> is a solution of the fixed point problem <math>Fix({(I-F)\circ P_{\mathcal{C}}})</math>, we have | ||

+ | <math>P_{\mathcal{C}}(x)-F(P_{\mathcal{C}}(x))=x.</math> Thus, <math>P_{\mathcal{C}}(P_{\mathcal{C}}(x)-F(P_{\mathcal{C}}(x)))=P_{\mathcal{C}}(x)</math>. Hence, <math>P_{\mathcal{C}}(x)</math> is a solution of the fixed point problem <math>Fix(P_{\mathcal{C}}\circ(I-F))</math> and [[Complementarity_problem#Every_variational_inequality_is_equivalent_to_a_fixed_point_problem | thus]] a solution of the variational inequality <math>VI(F,\mathcal{C}).</math> In particular, if <math>\mathcal{C}</math> is a closed convex cone, then the variational inequality <math>VI(F,\mathcal{C})</math> [[Complementarity_problem#Every_variational_inequality_defined_on_a_closed_convex_cone_is_equivalent_to_a_complementarity_problem | becomes]] the complementarity problem <math>NCP(F,\mathcal{C}).</math> | ||

+ | |||

+ | == Implicit complementarity problems == | ||

+ | Let <math>\mathcal K</math> be a closed convex cone in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>F,G:\,\mathbb{H}\to\mathbb{H}</math> two mappings. Recall that the dual cone of <math>\mathcal K</math> is the closed convex cone <math>\mathcal K^*=-\mathcal K^\circ</math> where <math>\mathcal K^\circ</math> is the | ||

[[Moreau's_decomposition_theorem#Moreau.27s_theorem |polar]] | [[Moreau's_decomposition_theorem#Moreau.27s_theorem |polar]] | ||

of <math>\mathcal K.</math> The '''implicit complementarity problem''' defined by <math>\mathcal K</math> | of <math>\mathcal K.</math> The '''implicit complementarity problem''' defined by <math>\mathcal K</math> | ||

- | and the ordered pair of mappings <math>( | + | and the ordered pair of mappings <math>(F,G)\,</math> is the problem |

<center> | <center> | ||

<math> | <math> | ||

- | ICP( | + | ICP(F,G,\mathcal{K}):\,\left\{ |

\begin{array}{l} | \begin{array}{l} | ||

- | Find | + | \textrm{Find }u\in\mathbb{H}\textrm{ such that}\\\\\\ |

- | + | G(u)\in\mathcal{K},\,\,\,F(u)\in\mathcal{K}^*,\,\,\,\langle G(u),F(u)\rangle=0. | |

\end{array} | \end{array} | ||

\right. | \right. | ||

Line 140: | Line 155: | ||

</center> | </center> | ||

- | + | == Every implicit complementarity problem is equivalent to a fixed point problem == | |

- | + | Let <math>\mathcal K</math> be a closed convex cone in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>F,G:\,\mathbb{H}\to\mathbb{H}</math> two mappings. Then the [[Complementarity_problem#Implicit_complementarity_problems | implicit complementarity problem]] <math>ICP(F,G,\mathcal K)</math> is equivalent to the [[Complementarity_problem#Fixed_point_problems | fixed point problem]] | |

- | Let <math>\mathcal K</math> be a closed convex cone in the Hilbert space <math>(\mathbb H,\langle\cdot,\cdot\rangle)</math> and <math> | + | <math>Fix(I-G+P_{\mathcal K}\circ(G-F))</math> where <math>I:\,\mathbb{H}\to\mathbb{H}</math> is the identity mapping defined by <math>I(x)=x.\,</math> |

- | <math>Fix(I- | + | |

=== Proof === | === Proof === | ||

- | + | For all <math>u\in\mathbb{H}</math> denote <math>z=G(u)-F(u),\,</math> <math>x=G(u),\,</math> and <math>y=-F(u).\,</math> Then | |

- | For all <math>u\in\mathbb H</math> denote <math>z= | + | |

<math>z=x+y.\,</math> | <math>z=x+y.\,</math> | ||

<br> | <br> | ||

<br> | <br> | ||

- | Suppose that <math>u\,</math> is a solution of <math>ICP( | + | Suppose that <math>u\,</math> is a solution of <math>ICP(F,G,\mathcal K).</math> |

- | [[Moreau's_decomposition_theorem#Moreau.27s_theorem | Moreau's theorem]], | + | Then <math>z=x+y\,</math> with <math>x\in\mathcal K,</math> <math>y\in\mathcal K^\circ,</math> and <math>\langle x,y\rangle=0.</math> |

- | + | Via [[Moreau's_decomposition_theorem#Moreau.27s_theorem|Moreau's theorem]], | |

- | <math>Fix(I- | + | <math>x=P_{\mathcal K}z.</math> |

+ | Therefore <math>u\,</math> is a solution of | ||

+ | <math>Fix(I-G+P_{\mathcal K}\circ(G-F)).</math> | ||

<br> | <br> | ||

<br> | <br> | ||

- | Conversely, suppose that <math>u\,</math> is a solution of <math>Fix(I- | + | Conversely, suppose that <math>u\,</math> is a solution of <math>Fix(I-G+P_{\mathcal K}\circ(G-F)).</math> |

- | Then | + | Then <math>x\in\mathcal K</math> and, via |

- | [[Moreau's_decomposition_theorem#Moreau.27s_theorem | Moreau's theorem]] | + | [[Moreau's_decomposition_theorem#Moreau.27s_theorem|Moreau's theorem]], |

<center> | <center> | ||

Line 167: | Line 182: | ||

</center> | </center> | ||

- | Hence | + | Hence <math>P_{\mathcal K^\circ}(z)=z-x=y,</math> thus <math>y\in\mathcal K^\circ</math>. |

- | [[Moreau's_decomposition_theorem#Moreau.27s_theorem | Moreau's theorem]] | + | [[Moreau's_decomposition_theorem#Moreau.27s_theorem|Moreau's theorem]] |

- | also implies | + | also implies <math>\langle x,y\rangle=0.</math> In conclusion, |

- | <math> | + | <math>G(u)=x\in\mathcal K,</math> <math>F(u)=-y\in\mathcal K^*,</math> and <math>\langle G(u),F(u)\rangle=0.</math> |

+ | Therefore <math>u\,</math> is a solution of <math>ICP(F,G,\mathcal K).</math> | ||

=== Remark === | === Remark === | ||

+ | If <math>\,G=I,</math> in particular, we obtain the result | ||

+ | [[Complementarity_problem#Every_nonlinear_complementarity_problem_is_equivalent_to_a_fixed_point_problem | ''every nonlinear complementarity problem is equivalent to a fixed point problem'']]. | ||

+ | But the more general result, [[Complementarity_problem#Every_implicit_complementarity_problem_is_equivalent_to_a_fixed_point_problem | ''every implicit complementarity problem is equivalent to a fixed point problem'']], has no known connection with [[Complementarity_problem#Variational_inequalities | variational inequalities]]. Using [[Moreau's_decomposition_theorem#Moreau.27s_theorem|Moreau's theorem]] is therefore essential for proving the latter result. | ||

- | + | == Nonlinear optimization problems == | |

- | [[ | + | Let <math>\mathcal C</math> be a closed convex set in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>f:\,\mathbb{H}\to\mathbb{R}</math> a function. The |

- | + | '''nonlinear optimization problem''' defined by <math>\mathcal C</math> and | |

+ | <math>f\,</math> is the problem | ||

+ | |||

+ | <center> | ||

+ | <math> | ||

+ | NOPT(f,\mathcal C):\,\left\{ | ||

+ | \begin{array}{l} | ||

+ | \textrm{Find }x\in\mathcal C\textrm{ such that}\\\\\\ | ||

+ | f(x)\leq f(y)\textrm{ for all }y\in\mathcal C | ||

+ | \end{array} | ||

+ | \right. | ||

+ | |||

+ | \,~\equiv~\, | ||

+ | |||

+ | \begin{array}{ll} | ||

+ | \textrm{Minimize} & f(x)\\ | ||

+ | \textrm{Subject to} & x\in\mathcal C | ||

+ | \end{array} | ||

+ | |||

+ | </math> | ||

+ | </center> | ||

+ | |||

+ | == Any solution of a nonlinear optimization problem is a solution of a variational inequality == | ||

+ | Let <math>\mathcal C</math> be a closed convex set in the Hilbert space <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>f:\,\mathbb{H}\to\mathbb{R}</math> a differentiable | ||

+ | function. Then any solution of the [[Complementarity_problem#Nonlinear_optimization_problems| nonlinear optimization problem ]] <math>NOPT(f,\mathcal C)</math> is a solution of the [[Complementarity_problem#Variational_inequalities | variational inequality]] <math>VI(\nabla f,\mathcal C)</math> where <math>\nabla f</math> is the gradient of <math>f.\,</math> | ||

+ | |||

+ | === Proof === | ||

+ | Let <math>\,x\in\mathcal C</math> be a solution of <math>NOPT(f,\mathcal C)</math> and | ||

+ | <math>y\in\mathcal C</math> an arbitrary point. Then by convexity of | ||

+ | <math>\mathcal C</math> we have <math>x+t(y-x)\in\mathcal C,</math> hence | ||

+ | <math>f(x)\leq f(x+t(y-x))</math> and | ||

+ | <center> | ||

+ | <math>\langle \nabla f(x),y-x\rangle=\displaystyle\lim_{t\searrow 0}\frac{f(x+t(y-x))-f(x)}t\geq0.</math> | ||

+ | </center> | ||

+ | Therefore <math>x\,</math> is a solution of <math>VI(\nabla f,\mathcal C).</math> | ||

+ | |||

+ | == A convex optimization problem is equivalent to a variational inequality == | ||

+ | Let <math>\mathcal C</math> be a closed convex set in the Hilbert space | ||

+ | <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>f:\,\mathbb{H}\to\mathbb{R}</math> a | ||

+ | differentiable convex function. | ||

+ | Then the [[Complementarity_problem#Nonlinear_optimization_problems | nonlinear optimization problem]] <math>NOPT(f,\mathcal C)</math> is equivalent to the [[Complementarity_problem#Variational_inequalities | variational inequality]] <math>VI(\nabla f,\mathcal C)</math> where <math>\nabla f</math> is the gradient of <math>f.\,</math> | ||

+ | |||

+ | === Proof === | ||

+ | Any solution of <math>NOPT(f,\mathcal C)</math> | ||

+ | [[Complementarity_problem#Any_solution_of_a_nonlinear_optimization_problem_is_a_solution_of_a_variational_inequality | is a solution of]] | ||

+ | <math>VI(\nabla f,\mathcal C).</math> | ||

+ | |||

+ | Conversely, suppose that <math>x\,</math> is a solution of <math>VI(\nabla f,\mathcal C).</math> By | ||

+ | convexity of <math>f\,</math> we have <math>f(y)-f(x)\geq\langle\nabla f(x),y-x\rangle\geq0</math> | ||

+ | for all <math>y\in\mathcal C.</math> Therefore <math>x\,</math> is a solution of | ||

+ | <math>NOPT(f,\mathcal C).</math> | ||

+ | |||

+ | == Any solution of a nonlinear optimization problem on a closed convex cone is a solution of a nonlinear complementarity problem == | ||

+ | Let <math>\mathcal K</math> be a closed convex cone in the Hilbert space | ||

+ | <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>f:\,\mathbb{H}\to\mathbb{R}</math> a differentiable function. Then any solution of the [[Complementarity_problem#Nonlinear_optimization_problems | nonlinear optimization problem]] <math>NOPT(f,\mathcal K)</math> is a | ||

+ | solution of the [[Complementarity_problem#Nonlinear_complementarity_problems | nonlinear complementarity problem]] <math>NCP(\nabla f,\mathcal K).</math> | ||

+ | |||

+ | === Proof === | ||

+ | Any solution of <math>NOPT(f,\mathcal K)</math> [[Complementarity_problem#Any_solution_of_a_nonlinear_optimization_problem_is_a_solution_of_a_variational_inequality | is a solution of]] | ||

+ | <math>VI(\nabla f,\mathcal K)</math> which [[Complementarity_problem#Every_variational_inequality_defined_on_a_closed_convex_cone_is_equivalent_to_a_complementarity_problem| is equivalent to]] <math>NCP(\nabla f,\mathcal K).</math> | ||

+ | |||

+ | == A convex optimization problem on a closed convex cone is equivalent to a nonlinear complementarity problem == | ||

+ | '''Theorem NOPT.''' Let <math>\mathcal K</math> be a closed convex cone in the Hilbert space | ||

+ | <math>(\mathbb{H},\langle\cdot,\cdot\rangle)</math> and <math>f:\,\mathbb{H}\to\mathbb{R}</math> | ||

+ | a differentiable convex function. Then the [[Complementarity_problem#Nonlinear_optimization_problems | nonlinear optimization problem]] <math>NOPT(f,\mathcal K)</math> is equivalent to the [[Complementarity_problem#Nonlinear_complementarity_problems | nonlinear complementarity problem]] | ||

+ | <math>NCP(\nabla f,\mathcal K).</math> | ||

+ | |||

+ | === Proof === | ||

+ | <math>NOPT(f,\mathcal K)</math> [[Complementarity_problem#A_convex_optimization_problem_is_equivalent_to_a_variational_inequality | is equivalent to]] <math>VI(\nabla f,\mathcal K)</math> which [[Complementarity_problem#Every_variational_inequality_defined_on_a_closed_convex_cone_is_equivalent_to_a_complementarity_problem| is equivalent to]] <math>NCP(\nabla f,\mathcal K).</math> | ||

+ | |||

+ | == An implicit complementarity problem can be associated to an optimization problem == | ||

+ | |||

+ | It follows from the definition of an [[Complementarity_problem#Implicit_complementarity_problems | implicit complementarity problem]] that <math>y</math> is a solution of <math>ICP(F,G,\mathcal{K})</math> if and only the minimal value of <math>\langle G(x),F(x)\rangle</math> subject to <math>G(x)\in\mathcal{K}</math> and <math>F(x)\in\mathcal{K}^*</math> is <math>0</math> at <math>y.</math> | ||

+ | |||

+ | == Fat nonlinear programming problem == | ||

+ | Let <math>f:\,\mathbb{R}^n\to\mathbb{R}</math> be a function, <math>b\in\mathbb{R}^n,</math> and | ||

+ | <math>A\in\mathbb{R}^{m\times n}</math> a fat matrix of full rank <math>m\leq n.</math> | ||

+ | Then the problem | ||

+ | |||

+ | <center> | ||

+ | <math> | ||

+ | NP(f,A,b):\,\left\{ | ||

+ | \begin{array}{ll} | ||

+ | \textrm{Minimize} & f(x)\\ | ||

+ | \textrm{Subject to} & Ax\leq b | ||

+ | \end{array} | ||

+ | \right. | ||

+ | </math> | ||

+ | </center> | ||

+ | |||

+ | is called '''fat nonlinear programming problem'''. | ||

+ | |||

+ | == Any solution of a fat nonlinear programming problem is a solution of a nonlinear complementarity problem defined by a polyhedral cone == | ||

+ | Let <math>f:\,\mathbb{R}^n\to\mathbb{R}</math> be a differentiable function, | ||

+ | <math>b\in\mathbb{R}^m,</math> and | ||

+ | <math>A\in\mathbb{R}^{m\times n}</math> a fat matrix of full rank <math>m\leq n.</math> | ||

+ | If <math>x\in\mathbb{R}^n</math> is a solution of the [[Complementarity_problem#Fat_nonlinear_programming_problem|fat nonlinear programming problem]] | ||

+ | <math>NP(f,A,b),\,</math> then <math>x-x_0\in\mathbb{R}^n</math> is a solution of the [[Complementarity_problem#Nonlinear_complementarity_problems|nonlinear | ||

+ | complementarity problem]] <math>NCP(G,\mathcal K)</math> where <math>x_0\!\in\mathbb{R}^n</math> is | ||

+ | a particular solution of the linear system of equations <math>Ax=b,\,</math> | ||

+ | <math>\mathcal K</math> is the polyhedral cone defined by | ||

+ | |||

+ | <center> | ||

+ | <math>\mathcal K=\{x\,\mid\,Ax\leq0\}</math> | ||

+ | </center> | ||

+ | |||

+ | and | ||

+ | <math>G:\,\mathbb{R}^n\to\mathbb{R}^n</math> is defined by | ||

+ | |||

+ | <center> | ||

+ | <math>G(x)=\nabla f(x+x_0)</math> | ||

+ | </center> | ||

+ | |||

+ | |||

+ | === Proof === | ||

+ | Let <math>x\in\mathbb{R}^n</math> be a solution of <math>NP(f,A,b).\,</math> | ||

+ | Then it is easy to see that <math>x-x_0\,</math> is a solution of <math>\,NP(g,A,0)</math> where <math>g:\,\mathbb{R}^n\to\mathbb{R}</math> is defined by | ||

+ | <math>g(x)=f(x+x_0).\,</math> | ||

+ | [[Complementarity_problem#A convex optimization problem on a closed convex cone is equivalent to a nonlinear complementarity problem|It follows from Theorem NOPT]] that <math>x-x_0\,</math> is a solution of <math>NCP(G,\mathcal K)</math> because <math>G(x)=\nabla f(x+x_0)=\nabla g(x).</math> | ||

+ | |||

+ | === Remark === | ||

+ | If <math>f\,</math> is convex, then the converse of the above results also holds. | ||

+ | In other words, <math>NP(f,A,b)\equiv NP(g,A,0)\equiv NOPT(g,\mathcal{K})\equiv NCP(G,\mathcal{K}),</math> where the first equivalence has a slightly different meaning than the other ones, but it should be self-explanatory. | ||

+ | |||

+ | Since a very large class of nonlinear programming problems can be reduced to [[Complementarity_problem#Nonlinear_complementarity_problems|nonlinear complementarity problems]], the importance of [[Complementarity_problem#Nonlinear_complementarity_problems|nonlinear complementarity problems]] on polyhedral cones is obvious both from theoretical and practical point of view. | ||

+ | |||

+ | == Mixed complementarity problems == | ||

+ | |||

+ | Let <math>\mathbb{I}</math> and <math>\mathbb{J}</math> be two Hilbert spaces and <math>\mathcal{K}=\mathbb{I}\times K</math>, where <math>K</math> is an arbitrary closed convex cone in <math>\mathbb{J}</math>. Let <math>G:\,\mathbb{I}\times\mathbb{J}\rightarrow\mathbb{I}</math>, <math>H:\,\mathbb{I}\times\mathbb{J}\to\mathbb{J}</math> and <math>F=(G,H):\,\mathbb{I}\times\mathbb{J}\to\mathbb{I}\times\mathbb{J}</math>. Then, the [[Complementarity_problem#Nonlinear_complementarity_problems|nonlinear complementarity problem]] <math>NCP(F,\mathcal{K})</math> is equivalent to the mixed complementarity problem <math>MiCP(G,H,K)</math> defined by | ||

+ | <center> | ||

+ | <math> | ||

+ | G(x,y)=0,\textrm{ }K\ni y\perp H(x,y)\in K^*. | ||

+ | </math> | ||

+ | </center> | ||

+ | |||

+ | === Proof === | ||

+ | |||

+ | Indeed, <math>MiCP(G,H,K)</math> is a simple equivalent reformulation of the [[Complementarity_problem#Nonlinear_complementarity_problems|nonlinear complementarity problem]] <math>NCP(F,\mathcal{K})</math>, by noting that <math>\mathcal{K}^*=\{0\}\times K^*</math>. |

## Current revision

(In particular, we can have everywhere in this page.)

## Fixed point problems

Let be a set and a mapping. The **fixed point problem** defined by is the problem

## Nonlinear complementarity problems

Let be a closed convex cone in the Hilbert space and a mapping. Recall that the dual cone of is the closed convex cone where is the polar of The **nonlinear complementarity problem** defined by and is the problem

## Every nonlinear complementarity problem is equivalent to a fixed point problem

Let be a closed convex cone in the Hilbert space and a mapping. Then the nonlinear complementarity problem is equivalent to the fixed point problem where is the identity mapping defined by and is the projection onto

### Proof

For all denote and Then

Suppose that is a solution of Then with
and Hence, via Moreau's theorem, we get Therefore is a solution of

Conversely, suppose that is a solution of Then and via Moreau's theorem

Hence thus Moreau's theorem also implies that In conclusion, and Therefore is a solution of

### An alternative proof without Moreau's theorem

#### Variational inequalities

Let be a closed convex set in the Hilbert space and a mapping. The **variational inequality** defined by and is the problem

##### Remark

The next result is not needed for the alternative proof and it can be skipped. However, it is an important property in its own. It was included for the completeness of the ideas.

#### Every fixed point problem defined on closed convex set is equivalent to a variational inequality

Let be a closed convex set in the Hilbert space and a mapping. Then the fixed point problem is equivalent to the variational inequality where

##### Proof

Suppose that is a solution of . Then, and thus is a solution of

Conversely, suppose that is a solution of and let Then, which is equivalent to Hence, ; that is, is a solution of .

#### Every variational inequality is equivalent to a fixed point problem

Let be a closed convex set in the Hilbert space and a mapping. Then the variational inequality is equivalent to the fixed point problem

##### Proof

is a solution of if and only if Via characterization of the projection, the latter equation is equivalent to

for all But this holds if and only if is a solution to

##### Remark

The next section shows that the equivalence of variational inequalities and fixed point problems is much stronger than the equivalence of nonlinear complementarity problems and fixed point problems because each nonlinear complementarity problem is a variational inequality defined on a closed convex cone.

#### Every variational inequality defined on a closed convex cone is equivalent to a complementarity problem

Let be a closed convex cone in the Hilbert space and a mapping. Then the nonlinear complementarity problem is equivalent to the variational inequality

##### Proof

Suppose that is a solution of Then and Hence

for all Therefore is a solution of

Conversely, suppose that is a solution of Then and

for all Choosing and in particular, we get a system of two inequalities that demands Thus for all equivalently, In conclusion, and Therefore is a solution to

#### Concluding the alternative proof

Since is a closed convex cone, the nonlinear complementarity problem is equivalent to the variational inequality which is equivalent to the fixed point problem

## Another fixed point problem providing solutions for variational inequalities and complementarity problems

Let be a closed convex set in the Hilbert space the identity mapping defined by and a mapping. Then, for any solution of the fixed point problem the projection of onto is a solution of the variational inequality

### Proof

Since is a solution of the fixed point problem , we have Thus, . Hence, is a solution of the fixed point problem and thus a solution of the variational inequality In particular, if is a closed convex cone, then the variational inequality becomes the complementarity problem

## Implicit complementarity problems

Let be a closed convex cone in the Hilbert space and two mappings. Recall that the dual cone of is the closed convex cone where is the
polar
of The **implicit complementarity problem** defined by
and the ordered pair of mappings is the problem

## Every implicit complementarity problem is equivalent to a fixed point problem

Let be a closed convex cone in the Hilbert space and two mappings. Then the implicit complementarity problem is equivalent to the fixed point problem where is the identity mapping defined by

### Proof

For all denote and Then

Suppose that is a solution of
Then with and
Via Moreau's theorem,
Therefore is a solution of

Conversely, suppose that is a solution of Then and, via Moreau's theorem,

Hence thus . Moreau's theorem also implies In conclusion, and Therefore is a solution of

### Remark

If in particular, we obtain the result
*every nonlinear complementarity problem is equivalent to a fixed point problem*.
But the more general result, *every implicit complementarity problem is equivalent to a fixed point problem*, has no known connection with variational inequalities. Using Moreau's theorem is therefore essential for proving the latter result.

## Nonlinear optimization problems

Let be a closed convex set in the Hilbert space and a function. The
**nonlinear optimization problem** defined by and
is the problem

## Any solution of a nonlinear optimization problem is a solution of a variational inequality

Let be a closed convex set in the Hilbert space and a differentiable function. Then any solution of the nonlinear optimization problem is a solution of the variational inequality where is the gradient of

### Proof

Let be a solution of and an arbitrary point. Then by convexity of we have hence and

Therefore is a solution of

## A convex optimization problem is equivalent to a variational inequality

Let be a closed convex set in the Hilbert space and a differentiable convex function. Then the nonlinear optimization problem is equivalent to the variational inequality where is the gradient of

### Proof

Any solution of is a solution of

Conversely, suppose that is a solution of By convexity of we have for all Therefore is a solution of

## Any solution of a nonlinear optimization problem on a closed convex cone is a solution of a nonlinear complementarity problem

Let be a closed convex cone in the Hilbert space and a differentiable function. Then any solution of the nonlinear optimization problem is a solution of the nonlinear complementarity problem

### Proof

Any solution of is a solution of which is equivalent to

## A convex optimization problem on a closed convex cone is equivalent to a nonlinear complementarity problem

**Theorem NOPT.** Let be a closed convex cone in the Hilbert space
and
a differentiable convex function. Then the nonlinear optimization problem is equivalent to the nonlinear complementarity problem

### Proof

is equivalent to which is equivalent to

## An implicit complementarity problem can be associated to an optimization problem

It follows from the definition of an implicit complementarity problem that is a solution of if and only the minimal value of subject to and is at

## Fat nonlinear programming problem

Let be a function, and a fat matrix of full rank Then the problem

is called **fat nonlinear programming problem**.

## Any solution of a fat nonlinear programming problem is a solution of a nonlinear complementarity problem defined by a polyhedral cone

Let be a differentiable function, and a fat matrix of full rank If is a solution of the fat nonlinear programming problem then is a solution of the nonlinear complementarity problem where is a particular solution of the linear system of equations is the polyhedral cone defined by

and is defined by

### Proof

Let be a solution of Then it is easy to see that is a solution of where is defined by It follows from Theorem NOPT that is a solution of because

### Remark

If is convex, then the converse of the above results also holds. In other words, where the first equivalence has a slightly different meaning than the other ones, but it should be self-explanatory.

Since a very large class of nonlinear programming problems can be reduced to nonlinear complementarity problems, the importance of nonlinear complementarity problems on polyhedral cones is obvious both from theoretical and practical point of view.

## Mixed complementarity problems

Let and be two Hilbert spaces and , where is an arbitrary closed convex cone in . Let , and . Then, the nonlinear complementarity problem is equivalent to the mixed complementarity problem defined by

### Proof

Indeed, is a simple equivalent reformulation of the nonlinear complementarity problem , by noting that .