A subgradient method for convex inequality systems in Hilbert space has finite termination when the system is strictly feasible and subgradients are bounded.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finite Termination of a Generalized Perceptron Algorithm
A subgradient method for convex inequality systems in Hilbert space has finite termination when the system is strictly feasible and subgradients are bounded.