Copositive programming via semi-infinite optimization

F. Ahmed, Mirjam Dür, Georg J. Still

Research output: Contribution to journalArticleAcademicpeer-review

11 Citations (Scopus)
1 Downloads (Pure)


Copositive programming (CP) can be regarded as a special instance of linear semi-infinite programming (SIP). We study CP from the viewpoint of SIP and discuss optimality and duality results. Different approximation schemes for solving CP are interpreted as discretization schemes in SIP. This leads to sharp explicit error bounds for the values and solutions in dependence on the mesh size. Examples illustrate the structure of the original program and the approximation schemes.
Original languageUndefined
Pages (from-to)322-340
Number of pages19
JournalJournal of optimization theory and applications
Issue number2
Publication statusPublished - 2013


  • EWI-23988
  • IR-87883
  • METIS-300167
  • Copositive programming · Semi-infinite programming · Optimality andduality · Discretization method · Order of maximizer

Cite this