An inexact subgradient algorithm achieves O(ε^{-2}) iteration complexity for ε-accurate solutions to copositive programs while allowing inexact solves of NP-hard quadratic subproblems and providing a sufficient condition for non-complete positivity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
An inexact subgradient algorithm achieves O(ε^{-2}) iteration complexity for ε-accurate solutions to copositive programs while allowing inexact solves of NP-hard quadratic subproblems and providing a sufficient condition for non-complete positivity.