Extension of subgradient techniques for nonsmooth optimization in Banach spaces. (English) Zbl 1049.90123

Summary: In this paper we continue the study of the subgradient method for nonsmooth convex constrained minimization problems in a uniformly convex and uniformly smooth Banach space. We consider the case when the stepsizes satisfy \(\sum_{k=1}^\infty \alpha_k=\infty, \lim_{k\to\infty}=0\).


90C48 Programming in abstract spaces
46N10 Applications of functional analysis in optimization, convex analysis, mathematical programming, economics
90C25 Convex programming
Full Text: DOI