Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (Q1723812): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59038014, #quickstatements; #temporary_batch_1707149277123 |
Removed claim: author (P16): Item:Q319185 |
||
| Property / author | |||
| Property / author: San-Yang Liu / rank | |||
Revision as of 05:00, 13 February 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
