This is a preview. Log in through your library . Abstract Let f be a positive real-valued function defined on an interval I ⊆ R. The function f is said to be log-convex if logf is convex on I. In this ...

Convex optimisation constitutes a fundamental area in applied mathematics where the objective is to identify the minimum of a convex function subject to a set of convex constraints. This framework ...

In the context of α-convexity, using an operator similar to the Monge-Ampère operator based on the notion of normal mapping, we estimate the difference between a function u and the solution of the ...