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

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

Full description

Saved in:

Bibliographic Details
Published in:	Computational optimization and applications Vol. 57; no. 2; pp. 403 - 415
Main Authors:	Dickinson, Peter J. C., Gijben, Luuk
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.03.2014 Springer Nature B.V
Subjects:	Algorithms Complexity Complexity theory Computation Convex and Discrete Geometry Management Science Mathematical models Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Programming Proving Statistics Studies Copositive NP-hard Stable set Completely positive
ISSN:	0926-6003, 1573-2894
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!