Abstract
Let f be a convex function defined on E n . The subgradient method is an algorithm which generates a sequence \(\{{x_k}\}_{k = 0}^\infty\) according to the formula
where x0 is a given starting point.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin, Heidelberg
About this chapter
Cite this chapter
Shor, N.Z. (1985). The Subgradient Method. In: Minimization Methods for Non-Differentiable Functions. Springer Series in Computational Mathematics, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82118-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-82118-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82120-2
Online ISBN: 978-3-642-82118-9
eBook Packages: Springer Book Archive