Sets of linear spaces satisfying various constraints have shown up in recent applications. Is is the case in multi-antenna systems of communications, where the constraints are packing-like, and in signal processing with compressed sensing and the so-called fusion frames.
The properties required for these sets are often natural generalizations of classical properties of configurations of points on the sphere.
We shall discuss how linear programming and semidefinite programming can be used to measure optimality with respect to these constraints.
Copyright. All Rights Reserved.