Minimization Methods for Non-Differentiable Functions V: Polyak's Stepsize and Fejér-Type ApproximationsTextbook
The subgradient method for a convex function moves from against a subgradient , and everything hinges on the step length. Divergent-series stepsizes guarantee convergence but are slow and need no information about . When the optimal value , or any level that is known to be attainable, is available, B. T. Polyak proposed in 1969 the step