On Poljak's improved subgradient method (Q1090617): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimization of unsmooth functionals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4182272 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An aggregate subgradient method for nonsmooth convex minimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A least-distance programming procedure for minimization problems under linear constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5608986 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the nearest point in A polytope / rank | |||
Normal rank | |||
Latest revision as of 19:17, 17 June 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
0 references
