Copositive Programming via Semi-Infinite Optimization

Faizan Ahmed (), Mirjam Dür () and Georg Still ()
Additional contact information
Faizan Ahmed: University of Twente
Mirjam Dür: University of Trier
Georg Still: University of Twente

Journal of Optimization Theory and Applications, 2013, vol. 159, issue 2, No 2, 322-340

Abstract: Abstract 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.

Keywords: Copositive programming; Semi-infinite programming; Optimality and duality; Discretization method; Order of maximizer (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-013-0344-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:159:y:2013:i:2:d:10.1007_s10957-013-0344-2

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-013-0344-2

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().