Two “well-known” properties of subgradient optimization
- First Online:
- Cite this article as:
- Anstreicher, K.M. & Wolsey, L.A. Math. Program. (2009) 120: 213. doi:10.1007/s10107-007-0148-y
- 564 Downloads
The subgradient method is both a heavily employed and widely studied algorithm for non-differentiable optimization. Nevertheless, there are some basic properties of subgradient optimization that, while “well known” to specialists, seem to be rather poorly known in the larger optimization community. This note concerns two such properties, both applicable to subgradient optimization using the divergent series steplength rule. The first involves convergence of the iterative process, and the second deals with the construction of primal estimates when subgradient optimization is applied to maximize the Lagrangian dual of a linear program. The two topics are related in that convergence of the iterates is required to prove correctness of the primal construction scheme.