DUALITY AND ALGORITHMS FOR SEPARABLE CONVEX OPTIMIZATION

Geometric and lp-norm optimization have been recently studied in the
framework of conic optimization, relying on the introduction of dedicated
convex cones. We present a generalization of these cones that leads to a
wide class of separable convex problems and investigate the development of
interior-point methods applicable to this class.