Novel shortcut strategies in copositivity detection: Decomposition for quicker positive certificates
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 w...
Saved in:
Main Authors: | Johannes Zischg, Immanuel Bomze |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2025-06-01
|
Series: | Operations Research Perspectives |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2214716024000289 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Short Paper - A note on the Frank–Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
by: de Oliveira, Welington
Published: (2023-01-01) -
An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2024-07-01) -
LNC points for m-convex sets
by: Marilyn Breen
Published: (1981-01-01) -
Positivity of convolution quadratures generated by nonconvex sequences
by: Karaa, Samir
Published: (2024-11-01) -
Deep Reinforcement Learning Algorithm with Long Short-Term Memory Network for Optimizing Unmanned Aerial Vehicle Information Transmission
by: Yufei He, et al.
Published: (2024-12-01)