0

If $f$ is a closed proper convex function defined on $\mathbb{R}^n$, prove that the function $\varphi$ defined by $\varphi(\lambda)=f((1-\lambda)x+\lambda y)$, where $x \in \text{dom}f, y \in \mathbb{R}^n$ is a convex function as well. I've tried proving it by brute calculation but it didn't work out well. Any ideas?

1 Answers1

1

Let $\alpha \in [0,1]$.

\begin{align} \varphi(\alpha \lambda_1 + (1-\alpha)\lambda_2)&=f((x+(\alpha \lambda_1 + (1-\alpha)\lambda_2)(y-x)))\\ &=f(\alpha (x+\lambda_1(y-x))+(1-\alpha)(x+\lambda_2(y-x))) \\ &\leq \alpha f(x+\lambda_1(y-x))+(1-\alpha)f(x+\lambda_2(y-x))\\ &=\alpha \varphi(\lambda_1)+(1-\alpha)\varphi(\lambda_2) \end{align}

Siong Thye Goh
  • 149,520
  • 20
  • 88
  • 149
  • Small detail to add: if $a\lambda_1 + (1-a)\lambda_2$ is a convex combination and $\lambda \in [0,1]$ then $(1-(a\lambda_1 + (1-a)\lambda_2))x + (a\lambda_1 + (1-a)\lambda_2)y$ is a convex combination of x and y. – Piotr Benedysiuk Jun 21 '16 at 09:22