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

This is a preview. Log in through your library . Abstract Duality theorems previously obtained for certain convex problems in the calculus of variations are applied to the study of the behavior of ...

This is a preview. Log in through your library . Abstract Let F be a finite model of cardinality M and denote by conv(F) its convex hull. The problem of convex aggregation is to construct a procedure ...

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