Motivating Mathematical Concepts through Problems

Diversification Constraints in Convex Optimization


Listen Later

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.

...more
View all episodesView all episodes
Download on the App Store

Motivating Mathematical Concepts through ProblemsBy Roland S McIntire