首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Copositive Programming via Semi-Infinite Optimization
Authors:Faizan Ahmed  Mirjam Dür  Georg Still
Institution:1. Department of Mathematics, University of Twente, 7500 AE, Enschede, the Netherlands
2. Department of Mathematics, University of Trier, 54286, Trier, Germany
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:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号