Diversification Constraints in Convex Optimization

Shows a way to add constraints to an optimization problem which wishes to bound the sum of the 'k' largest components of a given collection whiles minimizing a given objective.