A subgradient method for convex inequality systems in Hilbert space has finite termination when the system is strictly feasible and subgradients are bounded.
Mathematical Programming81(1), 23–35 (1998)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2verdicts
UNVERDICTED 2representative citing papers
Investigates Fejér* monotonicity in Hilbert spaces for optimization algorithms, its weak and strong convergence, and comparisons to quasi-Fejér-type notions via examples.
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.
-
Fej\'er* monotonicity in optimization algorithms
Investigates Fejér* monotonicity in Hilbert spaces for optimization algorithms, its weak and strong convergence, and comparisons to quasi-Fejér-type notions via examples.