Let be nonempty and bounded below. A lower bound equals exactly when every admits with . Otherwise would be a larger lower bound. Taking tolerances gives a sequence of members converging to . For a real-valued objective with finite infimum, this supplies a minimizing sequence without assuming that a global minimizer exists.

Articles by others on the same topic (NaN)

There are currently no matching articles.