3.2. Regularization [03F1]
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.2. Regularization
We will be smoothing various functions later on in this section so let us recall the standard regularization techniques. Given a convex bounded domain with piece-wise smooth boundary let be a mollifier whose support is , i.e. a positive function vanishing exactly outside and such that . For instance, if is a polytope in given by a collection of inequalities one can take the usual bell-shaped function
and the constant is determined from the normalization. Set . For any locally integrable function we can apply the standard regularization procedure by taking the convolution with :
Then, if , the functions are and approaching as in the -norm uniformly on any compact in .
Below we list some elementary properties of which will be useful later.
Proposition 3.1.
Let be a convex domain in , then
- •
is linear in a -direction in if is linear in the -direction in the Minkowski sum , with .
- •
is convex in if is. The gradient , is always inside the convex hull of all possible gradients of in .
- •
is strictly convex in if is convex in and strictly convex in .
Proof.
All statements are simple consequences of the following observation. The convolution is a weighted averaging of over the (translated) support of . The same holds for all derivatives of as well. ∎
One can also apply the regularization procedure by taking the convolution with the mollifier parameter depending (smoothly) on the point . That is . Or, even, more generally the entire shape of the support of the mollifier can smoothly depend on the center of convolution. We have used this technique of varying support to prove the existence of bi-PIKAS in Proposition 2.1.