Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

You should be able to...

Name: Anonymous 2008-12-27 21:29

Let [IEQ]X \subseteq \Re ^n[/IEQ] be a convex subset. Let [IEQ]f: X \rightarrow \Re [/IEQ] be a convex function. Prove for any [IEQ]a \in \Re[/IEQ], [IEQ]Z = \left\{x\in X \mid f(x) \leq a  \right\} [/IEQ] is a convex subset of [IEQ]\Re ^n[/IEQ]

Name: Anonymous 2008-12-28 11:43

Something more interesting, well slightly so, find a counterexample to the converse,

ie.  a function f s.t the condition that for all a { x | F(x)<=a} is convex, but f isn't a convex function

It's not that hard.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List