On the computational complexity of membership problems for the completely positive cone and its dual

Peter Dickinson () and Luuk Gijben ()

Computational Optimization and Applications, 2014, vol. 57, issue 2, 403-415

Abstract: Copositive programming has become a useful tool in dealing with all sorts of optimisation problems. It has however been shown by Murty and Kabadi (Math. Program. 39(2):117–129, 1987 ) that the strong membership problem for the copositive cone, that is deciding whether or not a given matrix is in the copositive cone, is a co-NP-complete problem. From this it has long been assumed that this implies that the question of whether or not the strong membership problem for the dual of the copositive cone, the completely positive cone, is also an NP-hard problem. However, the technical details for this have not previously been looked at to confirm that this is true. In this paper it is proven that the strong membership problem for the completely positive cone is indeed NP-hard. Furthermore, it is shown that even the weak membership problems for both of these cones are NP-hard. We also present an alternative proof of the NP-hardness of the strong membership problem for the copositive cone. Copyright Springer Science+Business Media New York 2014

Keywords: Copositive; Completely positive; NP-hard; Stable set (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-013-9594-z (text/html)
Access to full text is restricted to subscribers.

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:coopap:v:57:y:2014:i:2:p:403-415

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-013-9594-z

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

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