293. Copositive and semi-infinite optimization
Invited abstract in session TB-3: In memory of Georg Still - part 1, stream In memory of Georg Still.
Thursday, 10:05 - 11:20Room: M:J
Authors (first author is the speaker)
| 1. | Mirjam Duer
|
| Augsburg University |
Abstract
A copositive optimization problem is a problem in matrix variables involving the constraint that the matrix should lie in the copositive cone. Copositive programming can be regarded as a special instance of linear semi-infinite programming. This talk will study these relations and highlight the contributions Georg Still made in this field.
Keywords
- Conic and semidefinite optimization
Status: accepted
Back to the list of papers