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

Liguo Jiao, Jae Hyoung Lee, Yuto Ogata, Tamaki Tanaka, Multi-objective Optimization Problems with SOS-convex Polynomials over an LMI Constraint, Taiwanese Journal of Mathematics, Vol. 24, No. 4 ...

Mathematics of Operations Research, Vol. 5, No. 4 (Nov., 1980), pp. 576-594 (19 pages) We introduce the property of k-decomposability for simplicial complexes which, if satisfied by the dual ...