Constrained gradient method for nonsmooth optimization problems (Q1120810): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01095174 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042762901 / rank | |||
Normal rank | |||
Latest revision as of 10:41, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constrained gradient method for nonsmooth optimization problems |
scientific article |
Statements
Constrained gradient method for nonsmooth optimization problems (English)
0 references
1984
0 references
A nonsmooth convex function defined on a closed convex subset of a Hilbert space is minimized, by an algorithm where each iteration minimizes locally along some subgradient direction. Convergence is proved, under restrictions on step lengths.
0 references
nonsmooth convex function
0 references
subgradient
0 references
