Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/325801 
Erscheinungsjahr: 
2025
Quellenangabe: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 14 [Article No.:] 100324 [Year:] 2025 [Pages:] 1-12
Verlag: 
Elsevier, Amsterdam
Zusammenfassung: 
Copositivity is a property of symmetric matrices which is NP-hard to check. Nevertheless, it plays a crucial role in tight bounds for conic approaches of several hard optimization problems. In this paper, we present novel promising shortcut strategies to exploit favorable instances in a systematic way, using decomposition strategies based upon the idea to allow for overlapping, smaller blocks, profiting from a beneficial sign structure of the entries of the given matrix. The working hypothesis of this approach is the common empirical observation in the community that for detection of copositivity, a negative certificate is easier to obtain than a positive one. First empirical results on carefully orchestrated randomly generated instances seem to corroborate our approach.
Schlagwörter: 
Copositive optimization
Decomposition
Nonconvex quadratic optimization
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by-nc-nd Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.