Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (Q1723812): 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.1155/2014/305643 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087187949 / rank | |||
Normal rank | |||
Revision as of 02:32, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations |
scientific article |
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
