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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Classifies faces of copositive and completely positive cones over the second-order cone, examines dimension and exposedness, and computes two chain-related parameters.
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.
-
Facial structure of copositive and completely positive cones over a second-order cone
Classifies faces of copositive and completely positive cones over the second-order cone, examines dimension and exposedness, and computes two chain-related parameters.