For the equality-constrained minimization problem, and . Put . The restricted objective isThe only zero has , so . Since , the second-derivative criterion for convexity proves a unique minimizing . Consequently the equality constraint has minimizers and , with minimum .
For the inequality-constrained minimization problem, the identity supplies the universal lower bound . Both equality points for that bound, and , satisfy . Hence the inequality constraint has exactly these two minimizers, with minimum .
Articles by others on the same topic
There are currently no matching articles.