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

where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...

Convex geometry and combinatorial optimisation form a vibrant nexus of research that bridges theoretical mathematics with practical algorithm design. The study of convex sets and their structural ...

This is a preview. Log in through your library . Abstract We apply conjugate duality to establish the existence of optimal portfolios in an assetallocation problem, with the goal of minimizing the ...

This paper deals with the packing problem of circles and non-convex polygons, which can be both translated and rotated into a strip with prohibited regions. Using the Ф-function technique, a ...