I want to confirm whether my reasoning is correct regarding the following problem:
Suppose g is a pseudo convex function on R^n (see screenshot for definition). Let x* be a stationary point satisfying the first order necessary condition i.e it is a local minimizer with grad(g(x *)) = 0. Then for any point z in R^n we have grad(g(x*))(z-x) = 0 => grad(g(x*))(z-x) >=0 which by pseudo convexity of g implies g(z) >= g(x*) so x* is a global minimum. Is that right? Sounds too simple to be true.
. They now have 848