Testing approximate stationarity of piecewise affine functions is NP-hard; an exact Clarke subdifferential sum rule holds under a new polytope compatibility condition; near-approximate stationarity can be certified in oracle-polynomial time.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
Testing Approximate Stationarity Concepts for Piecewise Affine Functions
Testing approximate stationarity of piecewise affine functions is NP-hard; an exact Clarke subdifferential sum rule holds under a new polytope compatibility condition; near-approximate stationarity can be certified in oracle-polynomial time.