Epi-convergence explained

In mathematical analysis, epi-convergence is a type of convergence for real-valued and extended real-valued functions.

Epi-convergence is important because it is the appropriate notion of convergence with which to approximate minimization problems in the field of mathematical optimization. The symmetric notion of hypo-convergence is appropriate for maximization problems. Mosco convergence is a generalization of epi-convergence to infinite dimensional spaces.

Definition

Let

X

be a metric space, and

fn:X\toR

a real-valued function for each natural number

n

. We say that the sequence

(fn)

epi-converges to a function

f:X\toR

if for each

x\inX

\begin{align} &\liminfnfn(xn)\geqf(x)foreveryxn\toxand\\ &\limsupnfn(xn)\leqf(x)forsomexn\tox. \end{align}

Extended real-valued extension

The following extension allows epi-convergence to be applied to a sequence of functions with non-constant domain.

Denote by

\overline{R

}= \mathbb \cup \ the extended real numbers. Let

fn

be a function

fn:X\to\overline{R

} for each

n\inN

. The sequence

(fn)

epi-converges to

f:X\to\overline{R

} if for each

x\inX

\begin{align} &\liminfnfn(xn)\geqf(x)foreveryxn\toxand\\ &\limsupnfn(xn)\leqf(x)forsomexn\tox. \end{align}

In fact, epi-convergence coincides with the

\Gamma

-convergence in first countable spaces.

Hypo-convergence

Epi-convergence is the appropriate topology with which to approximate minimization problems. For maximization problems one uses the symmetric notion of hypo-convergence.

(fn)

hypo-converges to

f

if

\limsupnfn(xn)\leqf(x)foreveryxn\tox

and

\liminfnfn(xn)\geqf(x)forsomexn\tox.

Relationship to minimization problems

Assume we have a difficult minimization problem

infxg(x)

where

g:X\toR

and

C\subseteqX

. We can attempt to approximate this problem by a sequence of easier problems
inf
x\inCn

gn(x)

for functions

gn

and sets

Cn

.

Epi-convergence provides an answer to the question: In what sense should the approximations converge to the original problem in order to guarantee that approximate solutions converge to a solution of the original?

We can embed these optimization problems into the epi-convergence framework by defining extended real-valued functions

\begin{align} f(x)&=\begin{cases}g(x),&x\inC,\ infty,&x\not\inC,\end{cases}\\[4pt] fn(x)&=\begin{cases}gn(x),&x\inCn,\ infty,&x\not\inCn.\end{cases} \end{align}

So that the problems

infxf(x)

and

infxfn(x)

are equivalent to the original and approximate problems, respectively.

If

(fn)

epi-converges to

f

, then

\limsupn[inffn]\leqinff

. Furthermore, if

x

is a limit point of minimizers of

fn

, then

x

is a minimizer of

f

. In this sense,

\limn\operatorname{argmin}fn\subseteq\operatorname{argmin}f.

Epi-convergence is the weakest notion of convergence for which this result holds.

Properties

(fn)

epi-converges to

f

if and only if

(-fn)

hypo-converges to

-f

.

(fn)

epi-converges to

f

if and only if

(\operatorname{epi}fn)

converges to

\operatorname{epi}f

as sets, in the Painlevé–Kuratowski sense of set convergence. Here,

\operatorname{epi}f

is the epigraph of the function

f

.

fn

epi-converges to

f

, then

f

is lower semi-continuous.

fn

is convex for each

n\inN

and

(fn)

epi-converges to

f

, then

f

is convex.
1
f
n

\leqfn\leq

2
f
n

and both
1
(f
n)
and
2
(f
n)
epi-converge to

f

, then

(fn)

epi-converges to

f

.

(fn)

converges uniformly to

f

on each compact set of

Rn

and

(fn)

are continuous, then

(fn)

epi-converges and hypo-converges to

f

.

References