Solving Optimization Problems with Inequality Constraints

Basic Concepts

Similar to the equality-constrained optimization problems discussed earlier, optimization problems with inequality constraints can also be solved using the method of Lagrange multipliers. For the general form of an optimization problem:

minimizef(x)subject toh(x)=0g(x)≤0minimize\quad f(x)\\ subject\ to\quad h(x)=0\\ \quad\quad g(x)\le 0

where f:Rn→R,h:Rn→Rm,m≤n,g:Rn→Rpf:R^{n}\to R,h:R^{n}\to R^{m},m\le n,g:R^{n}\to R^{p}. We introduce the following two definitions:

Definition 1: For an inequality constraint gj(x)≤0g_{j}(x)\le 0, if gj(x∗)=0g_{j}(x^{*})=0 at x∗x^{*}, then this inequality constraint is said to be active at x∗x^{*}; if gj(x∗)<0g_{j}(x^{*})<0 at x∗x^{*}, then this constraint is said to be inactive at x∗x^{*}. By convention, equality constraints hi(x)h_{i}(x) are always treated as active.

Definition 2: Let x∗x^{*} satisfy h(x∗)=0,g(x∗)≤0h(x^{*})=0,g(x^{*})\le 0, and let J(x∗)J(x^{*}) be the index set of active inequality constraints:

J(x∗)≜{j:gj(x∗)=0}J(x^{*})\triangleq \{j:g_{j}(x^{*})=0\}

If the vectors

∇hi(x∗),∇gj(x∗),1≤i≤m,j∈J(x∗)\nabla h_{i}(x^{*}),\nabla g_{j}(x^{*}),1\le i\le m,j\in J(x^{*})

are linearly independent, then x∗x^{*} is said to be a regular point.

KKT Conditions

We now introduce the first-order necessary conditions that a point must satisfy to be a local minimizer, namely the KKT conditions. KKT conditions: Let f,h,g∈C1f,h,g\in C^{1}, and let x∗x^{*} be a regular point and a local minimizer of the problem h(x)=0,g(x)≤0h(x)=0,g(x)\le 0. Then there must exist λ∗∈Rm\lambda^{*}\in R^{m} and μ∗∈Rp\mu^{*}\in R^{p} such that the following conditions hold:

μ∗≥0Df(x∗)+λ∗TDh(x∗)+μ∗TDg(x∗)=0Tμ∗Tg(x∗)=0h(x∗)=0g(x∗)≤0\mu^{*}\ge0\\ Df(x^{*})+\lambda^{*T}Dh(x^{*})+\mu^{*T}Dg(x^{*})=0^{T}\\ \mu^{*T}g(x^{*})=0\\ h(x^{*})=0\\ g(x^{*})\le0

Thus, when solving an inequality-constrained optimization problem, we can search for points satisfying the KKT conditions and treat these points as candidates for the minimizer.

Second-Order Necessary and Sufficient Conditions

In addition to the first-order KKT conditions, there are also second-order necessary and sufficient conditions for solving problems of this kind.

Second-order necessary conditions: In the problem above, suppose x∗x^{*} is a minimizer and f,h,g∈C2f,h,g\in C^{2}. Assume x∗x^{*} is a regular point. Then there exist λ∗∈Rm\lambda^{*}\in R^{m} and μ∗∈Rp\mu^{*}\in R^{p} such that

  1. μ∗≥0,Df(x∗)+λ∗TDh(x∗)+μ∗TDg(x∗)=0T,μ∗Tg(x∗)=0\mu^{*}\ge 0,Df(x^{*})+\lambda^{*T}Dh(x^{*})+\mu^{*T}Dg(x^{*})=0^{T},\mu^{*T}g(x^{*})=0
  2. for all y∈T(x∗)y\in T(x^{*}), yTL(x∗,λ∗,μ∗)y≥0y^{T}L(x^{*},\lambda^{*},\mu^{*})y\ge0 holds

Second-order sufficient conditions: Assume f,h,g∈C2f,h,g\in C^{2}, that x∗∈Rnx^{*}\in R^{n} is a feasible point, and that there exist vectors λ∗∈Rm\lambda^{*}\in R^{m} and μ∗∈Rp\mu^{*}\in R^{p} such that

  1. μ∗≥0,Df(x∗)+λ∗TDh(x∗)+μ∗TDg(x∗)=0T,μ∗Tg(x∗)=0\mu^{*}\ge 0,Df(x^{*})+\lambda^{*T}Dh(x^{*})+\mu^{*T}Dg(x^{*})=0^{T},\mu^{*T}g(x^{*})=0
  2. for all y∈T~(x∗,μ∗),y≠0y\in \widetilde{T}(x^{*},\mu^{*}),y\neq0, yTL(x∗,λ∗,μ∗)y>0y^{T}L(x^{*},\lambda^{*},\mu^{*})y>0 holds

Then x∗x^{*} is a strict local minimizer of the optimization problem h(x)=0,g(x)≤0h(x)=0,g(x)\le 0.