Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (Q1723812)
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: Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations |
scientific article; zbMATH DE number 7022130
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations |
scientific article; zbMATH DE number 7022130 |
Statements
Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (English)
0 references
14 February 2019
0 references
Summary: Two unified frameworks of some sufficient descent conjugate gradient methods are considered. Combined with the hyperplane projection method of Solodov and Svaiter, they are extended to solve convex constrained nonlinear monotone equations. Their global convergence is proven under some mild conditions. Numerical results illustrate that these methods are efficient and can be applied to solve large-scale nonsmooth equations.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8830771446228027
0 references
0.8782447576522827
0 references
0.8781543970108032
0 references
0.8743821382522583
0 references
