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

Programming theory is treated initially without any assumptions about the functions and with interpretation for production and activity analysis. By proof of a general theorem about optimal and ...

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

Let $S$ denote the functions that are analytic and univalent in the open unit disk and satisfy $f(0) = 0$ and $f\prime(0) = 1$. Also, let $K, St, S_R$, and $C$ be the ...