Diversification Constraints in Convex Optimization
Motivating Mathematical Concepts through Problems by Roland S McIntire
Episode notes
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.
Keywords
DiversificationConvex OptimizationFinancial PortfoliosDual Problem