Spectral gradient projection method for monotone nonlinear equations with convex constraints (Q2271390): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.apnum.2009.04.004 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.APNUM.2009.04.004 / rank | |||
Normal rank |
Latest revision as of 18:32, 17 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Spectral gradient projection method for monotone nonlinear equations with convex constraints |
scientific article |
Statements
Spectral gradient projection method for monotone nonlinear equations with convex constraints (English)
0 references
7 August 2009
0 references
Monotone nonlinear equations with convex constraints arise in many applications. A spectral gradient projection algorithm for solving such systems is proposed. The idea of the new method is to combine a modified spectral gradient method [see \textit{W. la Cruz} and \textit{M. Raydan}, Optim. Methods Softw. 18, 583--599 (2003; Zbl 1069.65056)] and a projection method [see \textit{C. Wang, Y. Wang} and \textit{G. Xu}, Math. Methods Oper. Res. 66, 33--46 (2007; Zbl 1126.90067)]. The authors prove that the new method is globally convergent under some mild assumptions and show that it can be applied to nonsmooth equations. Finally, the results of preliminary numerical tests show the method seems to be more efficient than the projection method.
0 references
spectral gradient method
0 references
nonlinear equations
0 references
projection method
0 references
global convergence
0 references
numerical examples
0 references
systems
0 references
0 references
0 references
0 references
0 references
0 references