On subgradient projectors
Abstract
The subgradient projector is of considerable importance in convex optimization because it plays the key role in Polyak's seminal work - and the many papers it spawned - on subgradient projection algorithms for solving convex feasibility problems. In this paper, we offer a systematic study of the subgradient projector. Fundamental properties such as continuity, nonexpansiveness, and monotonicity are investigated. We also discuss the Yamagishi-Yamada operator. Numerous examples illustrate our results.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.