News for hackers. Stuff that matters.
Re:The "Soft Maximum" function by yummyfajitas on Wednesday January 20, 2010 @10:50PM (#1066576)
If the function is convex then it will have only 1 minimum...

f(x,y)=x^2 has an infinite set of minima: {(x,y) : x=0}, but is still convex.

Re:The "Soft Maximum" function by ntownsend on Wednesday January 20, 2010 @11:48PM (#1066650)
In the case of real-valued functions of one variable (which is the case at hand), if the function has a minimum and is convex then the minimum is global. If the function is strictly convex (also this case) then it will have at most one global minimum.
Re:The "Soft Maximum" function by jules on Thursday January 21, 2010 @05:46AM (#1067026)
True. To keep the explanation simple I glossed over some details. The problem you describe exists even in the 1D case, e.g. the function f(x) = 0. However if a convex function has multiple minima then the minima will be connected and at the same height, so the algorithms still apply.