ScalingStacks

3.6. Differences of concave functions [02N5]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

3.6. Differences of concave functions

Let C⊂NℝC\subset N_{\mathbb{R}} be a convex set. A function f:C→ℝf\colon C\to\mathbb{R} is called a difference of concave functions or a DC function if it can be written as f=g−hf=g-h for concave functions g,h:C→ℝg,h\colon C\to\mathbb{R}. DC functions play an important role in non-convex optimization and have been widely studied, see for instance [HT99] and the references therein. We will be interested in a subclass of DC functions, namely those which are a difference of uniform limits of piecewise affine concave functions.

Definition 3.82.

For a convex polyhedron Λ\Lambda in NℝN_{\mathbb{R}} we set

𝒟(Λ)={g−h∣g,h∈𝒫(Λ)},𝒟¯(Λ)={g−h∣g,h∈𝒫¯(Λ)}.{\mathscr{D}}(\Lambda)=\{g-h\mid g,h\in\mathscr{P}(\Lambda)\},\quad{\overline{\mathscr{D}}}(\Lambda)=\{g-h\mid g,h\in{\overline{\mathscr{P}}}(\Lambda)\}.

These spaces are closed under the operations of taking finite linear combinations, upper envelope and lower envelope.

Proposition 3.83.

Let Λ\Lambda be a convex polyhedron in NℝN_{\mathbb{R}} and f1,…,flf_{1},\dots,f_{l} functions in 𝒟⁡(Λ){\mathscr{D}}(\Lambda) (respectively, in 𝒟¯​(Λ){\overline{\mathscr{D}}}(\Lambda)). Then the functions

  1. (1)

    ∑iλi​fi\sum_{i}\lambda_{i}f_{i} for any λi∈ℝ\lambda_{i}\in\mathbb{R},

  2. (2)

    maxi⁡{fi}\max_{i}\{f_{i}\}, mini⁡{fi}\min_{i}\{f_{i}\}

are also in 𝒟⁡(Λ){\mathscr{D}}(\Lambda) (respectively, in 𝒟¯​(Λ){\overline{\mathscr{D}}}(\Lambda)).

Proof.

Statement (1) is obvious. For the statement (2), write fi=gi−hif_{i}=g_{i}-h_{i} with gi,hig_{i},h_{i} in 𝒫⁡(Λ)\mathscr{P}(\Lambda) (respectively, in 𝒫¯​(Λ){\overline{\mathscr{P}}}(\Lambda)). Then the upper envelope admits the DC decomposition maxi⁡{fi}=g−h\max_{i}\{f_{i}\}=g-h with

g:=∑jgj,h:=mini⁡(hi+∑j≠igj),g:=\sum_{j}g_{j},\quad h:=\min_{i}\bigg(h_{i}+\sum_{j\neq i}g_{j}\bigg),

which are both concave functions in 𝒫⁡(Λ)\mathscr{P}(\Lambda) (respectively, in 𝒫¯​(Λ){\overline{\mathscr{P}}}(\Lambda)). This shows that maxi⁡{fi}\max_{i}\{f_{i}\} is in 𝒟⁡(Λ)\mathscr{D}(\Lambda) (respectively, in 𝒟¯​(Λ){\overline{\mathscr{D}}}(\Lambda)). The statement for the lower envelope follows similarly. ∎

In particular, if ff lies in 𝒟⁡(Λ)\mathscr{D}(\Lambda) or in 𝒟¯​(Λ){\overline{\mathscr{D}}}(\Lambda), the same holds for the functions |f||f|, max⁡(f,0)\max(f,0) and min⁡(f,0)\min(f,0).

Corollary 3.84.

The space 𝒟⁡(Λ)\mathscr{D}(\Lambda) coincides with the space of piecewise affine functions on Λ\Lambda.

Proof.

This follows from the max-min representation of piecewise affine functions in [Ovc02] and Proposition 3.83(2). ∎

Some constructions for concave functions can be extended to this kind of functions. In particular, we can define the recession of a functions in 𝒟¯​(Λ){\overline{\mathscr{D}}}(\Lambda).

Definition 3.85.

Let Λ\Lambda be a polyhedron in NℝN_{\mathbb{R}} and f∈𝒟¯​(Λ)f\in{\overline{\mathscr{D}}}(\Lambda). The recession function of ff is defined as

(3.86) rec⁡(f):rec⁡(Λ)⟶ℝ,u⟼limλ→∞f⁡(v0+λ​u)−f⁡(v0)λ\operatorname{rec}(f)\colon\operatorname{rec}(\Lambda)\longrightarrow\mathbb{R},\quad u\longmapsto\lim_{\lambda\to\infty}\frac{f(v_{0}+\lambda u)-f(v_{0})}{\lambda}

for any v0∈Λv_{0}\in\Lambda.

Write f=g−hf=g-h for any g,h∈𝒫¯​(Λ)g,h\in{\overline{\mathscr{P}}}(\Lambda). By (3.49), we have that, for all u∈rec⁡(Λ)u\in\operatorname{rec}(\Lambda), the limit (3.86) exists and

rec⁡(f)​(u)=rec⁡(g)​(u)−rec⁡(h)​(u).\operatorname{rec}(f)(u)=\operatorname{rec}(g)(u)-\operatorname{rec}(h)(u).

Observe that the recession function of a function in 𝒟⁡(Λ)\mathscr{D}(\Lambda) is a piecewise linear function on a subdivision of the cone rec⁡(Λ)\operatorname{rec}(\Lambda) into polyhedral cones. Observe also that

|f−rec⁡(f)|≤|g−rec⁡(g)|+|h−rec⁡(h)|=O⁡(1).|f-\operatorname{rec}(f)|\leq|g-\operatorname{rec}(g)|+|h-\operatorname{rec}(h)|=O(1).

We will be mostly interested in the case when Λ=Nℝ\Lambda=N_{\mathbb{R}}.

Proposition 3.87.

Let ∥⋅∥\|\cdot\| be any metric on NℝN_{\mathbb{R}} and f∈𝒟¯​(Nℝ)f\in{\overline{\mathscr{D}}}(N_{\mathbb{R}}). Then there exists a constant κ>0\kappa>0 such that, for all u,v∈Nℝu,v\in N_{\mathbb{R}},

|f⁡(u)−f⁡(v)|≤κ​‖u−v‖.|f(u)-f(v)|\leq\kappa\|u-v\|.

A function which verifies the conclusion of this proposition is called Lipchitzian.

Proof.

Let f=g−hf=g-h with g,h∈𝒫¯​(Nℝ)g,h\in{\overline{\mathscr{P}}}(N_{\mathbb{R}}). The effective domain of the recessions of gg and of hh is the whole of NℝN_{\mathbb{R}}. By [Roc70, Theorem 10.5], both gg and hh are Lipchitzians, hence so is ff. ∎

Observe that 𝒟¯​(Nℝ){\overline{\mathscr{D}}}(N_{\mathbb{R}}) is not the completion of 𝒟⁡(Nℝ){\mathscr{D}}(N_{\mathbb{R}}) with respect to uniform convergence. It is easy to construct functions which are uniform limits of piecewise affine ones but do not verify the Lipschitz condition.

We will consider the integral and rational structures on the space of piecewise affine functions. We will use the notation previous to Definition 3.73.

Definition 3.88.

Let Λ\Lambda be a convex polyhedron and f∈𝒟⁡(Λ)f\in{\mathscr{D}}(\Lambda). We say that ff is an H-lattice (respectively V-lattice) function if it can be written as the difference of two H-lattice (respectively V-lattice) concave functions. We say that ff is a rational piecewise affine function if it is the difference of two rational piecewise affine concave functions.

Proposition 3.89.

If ff is an H-lattice function (respectively a rational piecewise affine function) on NℝN_{\mathbb{R}}, then there is a complete polyhedral complex Π\Pi in NℝN_{\mathbb{R}} such that, for every Λ∈Π\Lambda\in\Pi,

f|Λ​(u)=⟨mΛ,u⟩+lΛ,f|_{\Lambda}(u)=\langle m_{\Lambda},u\rangle+l_{\Lambda},

with (mΛ,lΛ)∈M×ℤ(m_{\Lambda},l_{\Lambda})\in M\times\mathbb{Z} (respectively (mΛ,lΛ)∈Mℚ×ℚ(m_{\Lambda},l_{\Lambda})\in M_{\mathbb{Q}}\times\mathbb{Q}). Conversely, every piecewise affine function on NℝN_{\mathbb{R}} such that its defining affine functions have integral (respectively rational) coefficients, is an H-lattice function (respectively a rational piecewise affine function).

Proof.

We will prove the statement for lattice functions. The statement for rational piecewise affine functions is proved with the same argument. If ff is an H-lattice function, we can write f=g−hf=g-h, where gg and hh are H-lattice concave functions. We obtain Π\Pi as any common refinement of Π⁡(g)\Pi(g) and Π⁡(h)\Pi(h) to a polyhedral complex. Then the statement follows from the definition of H-lattice concave functions. The converse is an easy consequence of Corollary 3.84. ∎

Definition 3.90.

Let ff be a rational piecewise affine function on NℝN_{\mathbb{R}}, and let Π\Pi and {(mΛ,lΛ)}Λ∈Π\{(m_{\Lambda},l_{\Lambda})\}_{\Lambda\in\Pi} be as in Proposition 3.89. The family {(mΛ,lΛ)}Λ∈Π\{(m_{\Lambda},l_{\Lambda})\}_{\Lambda\in\Pi} is called a set of defining vectors of ff.

Proposition 3.91.

Let Π\Pi be a complete SCR polyhedral complex in NℝN_{\mathbb{R}} and ff an H-lattice function on Π\Pi. Then rec⁡(f)\operatorname{rec}(f) is a conic H-lattice function on the fan rec⁡(Π)\operatorname{rec}(\Pi).

Proof.

Let Λ∈Π\Lambda\in\Pi and (m,l)∈M×ℤ(m,l)\in M\times\mathbb{Z} such that f⁡(u)=⟨m,u⟩+lf(u)=\langle m,u\rangle+l for u∈Λu\in\Lambda. Then, by the definition of rec⁡(f)\operatorname{rec}(f), it is clear that rec⁡(f)|rec⁡(Λ)​(u)=⟨m,u⟩\operatorname{rec}(f)|_{\operatorname{rec}(\Lambda)}(u)=\langle m,u\rangle. Hence, rec⁡(f)\operatorname{rec}(f) is a conic H-lattice function on rec⁡(Π)\operatorname{rec}(\Pi). ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.