For locally Lipschitz tame functions, stable points of first-order methods are exactly local minima, strict local minima are stable, and the critical-point set is globally stable for coercive functions.
Global stability of first-order methods for coercive tame functions,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Stability of first-order methods in tame optimization
For locally Lipschitz tame functions, stable points of first-order methods are exactly local minima, strict local minima are stable, and the critical-point set is globally stable for coercive functions.