Sensitivity of primal-dual solutions in graph-induced NLPs decays exponentially with graph distance under SOSC and LICQ.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2021 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs
Sensitivity of primal-dual solutions in graph-induced NLPs decays exponentially with graph distance under SOSC and LICQ.