Thursday, 14:15 - 14:40 h, Room: MA 041


John Mitchell
Quadratic programs with complementarity constraints

Coauthors: Lijie Bai, Jong-Shi Pang


We examine the relationship between a quadratic program with complementarity constraints (QPCC) and its completely positive relaxation. We show that the two problems are equivalent under certain conditions, even if the complementary variables are unbounded.
We describe the use of semidefinite programming to tighten up the quadratic relaxation of a QPCC when the quadratic objective function is convex.
When the variables are bounded,
a QPCC can be expressed as a mixed integer nonlinear program.


Talk 3 of the invited session Thu.2.MA 041
"Convex approaches for quadratic integer programs" [...]
Cluster 14
"Mixed-integer nonlinear programming" [...]


  payday advance . There are also a lot of other privileges for return customers. Men buy Viagra Gold online not to wait till the lucky event happens but to enjoy each sex act because Viagra effect lasts up to 36 hours!