Matrix inequalities and convex functions constitute a central theme in modern mathematical analysis, with far‐reaching implications across numerical analysis, optimisation, quantum information, and ...

A normalized univalent function is convex of bounded type if the curvature of the curve bounding the image domain lies between two fixed positive numbers. In this work we find sharp bounds for the ...

This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

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 ...