A boundary point is an epsilon-optimum of a reverse convex program exactly when every eps-prime subgradient of the constraint belongs to the union of eps-subdifferentials of scaled objectives.
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
-
${\varepsilon}$-optimality in reverse convex optimization
A boundary point is an epsilon-optimum of a reverse convex program exactly when every eps-prime subgradient of the constraint belongs to the union of eps-subdifferentials of scaled objectives.