Unconstrained global optimization using strict complementary slackness

摘要

By using interval arithmetic, we can show that strict complementary slackness holds at the local minimizers of unconstrained optimization problems. With this idea, the parallelepiped with sides parallel to the coordinate axes can be bisected for locating such minimizers.