On Poljak's improved subgradient method (Q1090617): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q581237 |
Changed an Item |
||
| Property / author | |||
| Property / author: Seokha Koh / rank | |||
Normal rank | |||
Revision as of 04:41, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Poljak's improved subgradient method |
scientific article |
Statements
On Poljak's improved subgradient method (English)
0 references
1988
0 references
\textit{B. T. Polyak} [USSR Comput. Math. Math. Phys. 9 (1969), No.3, 14-29 (1971; Zbl 0229.65056)] has suggested an improved subgradient method and provided a lower bound on the improvement of the Euclidean distance to an optimal solution. In this paper, we provide a stronger lower bound and show that the direction of movement in this method forms a more acute angle with the direction toward the set of optimal solutions than that in the subgradient method.
0 references
subgradient method
0 references
stronger lower bound
0 references
nondifferentiable optimization
0 references
cutting plane methods
0 references
