A relaxed hybrid steepest descent method for solving strongly convex minimization problem via conjugate gradient direction (Q5030893)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A relaxed hybrid steepest descent method for solving strongly convex minimization problem via conjugate gradient direction |
scientific article; zbMATH DE number 7476170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relaxed hybrid steepest descent method for solving strongly convex minimization problem via conjugate gradient direction |
scientific article; zbMATH DE number 7476170 |
Statements
17 February 2022
0 references
minimization problem
0 references
strongly convex
0 references
fixed point set
0 references
nonexpansive
0 references
conjugate gradient methods
0 references
0.817499577999115
0 references
0.8007522225379944
0 references
0.7969620227813721
0 references
