14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

38 <strong>Convex</strong> Functions<br />

F is convex. Using the convexity property of f , it is easy to show that the mapping<br />

I : w → I (w) =<br />

�b<br />

a<br />

f � x,w(x), w ′ (x) � dx ∈ R, for w ∈ F<br />

is a convex function on F. A solution y of the Euler–Lagrange equation is a stationary<br />

value of this mapping <strong>and</strong> thus a minimizer by convexity. If the mapping is<br />

strictly convex, then this minimizer is even the unique minimizer.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!