Proving local minimal to be global minimal in Convex optimization

Problem: min f(x) . s.t. g(x)<= 0 and h(x) = 0web f(x) and g(x) are convex, h(x) is affinesvg Analysis assume x is local optimal value. f(x) <= f(y) for all feasible y, || x - y ||<= pxml we need to p

>>阅读原文<<