Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Hi: I'm reading a proof in a convex optimization book and I don't understand something. The author states the following:

Let $Q$ be a subset of $R^{n}$. We denote by $C_{L}^{k,p}(Q)$, the class of functions with the following properties:

A) any $f \in C_{L}^{k,p}(Q)$ is $k$ times differentiable on $Q$.

B) Its $p$-th derivative is Lipschitz continuous on $Q$ with the constant $L$.

i.e: $\|f^{p}(x) - f^{p}(y)\| \le L\|x - y\|$.

This is fine. But then later, inside the proof, he states the following:

if $f \in C_{L}^{2,1}(R^{n})$, then for any $s \in R^{n}$ and $\alpha > 0$, we have

$$\left\|\left(\int_{0}^{\alpha}f''(x + \tau ~ s)d ~ \tau\right) s\right\| = \|f^{\prime}(x + \alpha s) - f^{\prime}(x) \| \le \alpha L \|s\|\;.$$

I don't understand how this is implied by the definition of Lipschitz continuity defined previously. Thanks a lot.

share|improve this question
add comment

1 Answer 1

Just putting in the definition of $f\in C^{2,1}_L(\mathbb{R}^n)$ gives

$$\|f^{(1)}(x+\alpha s)-f^{(1)}(x)\|\le L\|x+\alpha s -x\|=L\|\alpha s\| =L\alpha \|s\|$$

where I used positive homogeneity of the norm $\|\cdot\|$ in the last equality.

share|improve this answer
    
Hi Pavel: The book I am reading is titled "Introductory Lectures on Convex Optimization" by Yuri Nesterov. The guy is a god in the field so I'm pretty sure the statement is correct. Hi n.c.: Thank you for your help. I'll print it out and see if I follow it. –  mark leeds Jan 5 '13 at 15:06
    
No need to; I misread the definition. –  user53153 Jan 5 '13 at 15:57
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.