Semistrictly convex functions (Q1326501): Difference between revisions

The author considers on a convex subset \(C\subset \mathbb{R}^ n\) so called semistrictly convex function \(f\) defined by \[ \forall x,y\in C\forall\lambda\in (0,1): f(x)\neq f(y)\to f(\lambda x+(1- \lambda) y)< \lambda f(x)+ (1- \lambda) f(y). \] \(f\) is called explicitly convex iff it is convex and semistrictly convex. Using simple algebraic arrangements with the above definitions he obtains a ``finite-sum-equivalence'', a ``\(\sup_{\alpha\in I} f_ a(x)\)-property'' (valid for explicitly convex and not valid for semistrictly convex functions) and relations between the convexity, semistrict and strict convexity.