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:
where . We introduce the following two definitions:
Definition 1: For an inequality constraint , if at , then this inequality constraint is said to be active at ; if at , then this constraint is said to be inactive at . By convention, equality constraints are always treated as active.
Definition 2: Let satisfy , and let be the index set of active inequality constraints:
If the vectors
are linearly independent, then 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 , and let be a regular point and a local minimizer of the problem . Then there must exist and such that the following conditions hold:
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 is a minimizer and . Assume is a regular point. Then there exist and such that
- for all , holds
Second-order sufficient conditions: Assume , that is a feasible point, and that there exist vectors and such that
- for all , holds
Then is a strict local minimizer of the optimization problem .