Faizan Ahmad — On Connections between Copositive Programming and Semi-Infinite Programming
|Time:||Wednesday, January 11, 2012|
|Location:||Room 101, Citadel|
In this presentation we will briefly discuss copositive and semidefinite programming relaxations of combinatorial optimization problems. Then we will turn our attention to the connections between CP and LSIP. We will view copositive programming as a special instance of linear semi-infinite programming. Discretization methods are well known for solving LSIP (approximately). The connection between CP and LSIP will lead us to interpret many approximation schemes for CP as a special instance of discretization methods for LSIP. The error bound for these approximation schemes in terms of the mesh size will be analyzed in detail.