A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s12190-015-0912-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1113115316 / rank | |||
Normal rank | |||
Revision as of 17:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems |
scientific article |
Statements
A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (English)
0 references
13 June 2016
0 references
The authors propose a modified Polak-Ribi\(\grave{e}\)re-Polyak conjugate gradient algorithm with a nonmonotone line search technique for nonsmooth convex minimization and derive the global convergence of the method under suitable conditions. Some preliminary numerical results are provided to compare the proposed method with three other methods.
0 references
nonsmooth convex minimization
0 references
conjugate gradient
0 references
nonmonotone technique
0 references
global convergence
0 references
algorithm
0 references
numerical result
0 references
