Ekeland's variational principle

1

In mathematical analysis, Ekeland's variational principle, discovered by Ivar Ekeland, is a theorem that asserts that there exist nearly optimal solutions to some optimization problems. Ekeland's principle can be used when the lower level set of a minimization problems is not compact, so that the Bolzano–Weierstrass theorem cannot be applied. The principle relies on the completeness of the metric space. The principle has been shown to be equivalent to completeness of metric spaces. In proof theory, it is equivalent to Π1 1CA0 over RCA0, i.e. relatively strong. It also leads to a quick proof of the Caristi fixed point theorem.

History

Ekeland was associated with the Paris Dauphine University when he proposed this theorem.

Ekeland's variational principle

Preliminary definitions

A function**** valued**** in**** the extended**** real**** numbers **** is**** said**** to**** be**** ' if **** an**d it**** is**** called**** ' if it has a non-empty , which by** definition**** is**** the set and it is never equal to -\infty. In other words, a map is if is valued in and not identically +\infty. The map f is proper and bounded below if and only if or equivalently, if and only if A function is at a given x_0 \in X if for every real there exists a neighborhood U of x_0 such that f(u) > y for all u \in U. A function is called if it is lower semicontinuous at every point of X, which happens if and only if is an open set for every y \in \R, or equivalently, if and only if all of its lower level sets are closed.

Statement of the theorem

For example, if f and (X, d) are as in the theorem's statement and if x_0 \in X happens to be a global minimum point of f, then the vector v from the theorem's conclusion is v := x_0.

Corollaries

The principle could be thought of as follows: For any point x_0 which nearly realizes the infimum, there exists another point v, which is at least as good as x_0, it is close to x_0 and the perturbed function,, has unique minimum at v. A good compromise is to take in the preceding result.

This article is derived from Wikipedia and licensed under CC BY-SA 4.0. View the original article.

Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc.
Bliptext is not affiliated with or endorsed by Wikipedia or the Wikimedia Foundation.

Edit article