Thursday, 11:00 - 11:25 h, Room: H 2038


Faizan Ahmed
On connections between copositive programming and semi-infinite programming

Coauthor: Georg Still


In this presentation we will discuss about the connections between copositive programming(CP) and Linear Semi-infinite Programming(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 leads us to interpret certain approximation schemes for CP as a special instance of discretization methods for LSIP. We will provide an overview of error bound for these approximation schemes in terms of the mesh size. Examples will illustrate the structure of the programs.


Talk 2 of the invited session Thu.1.H 2038
"New results in copositive and semidefinite optimization" [...]
Cluster 4
"Conic programming" [...]


  Most online loan lenders allow getting New Jersey Payday Loans without visiting a bank, straight to your bank account. The main advantage of Viagra Soft Tablets comparing with other products of this type is its faster on-set effect.