Sufficient Descent Conjugate Gradient Methods for Solving Convex Constrained Nonlinear Monotone Equations
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 condition...
Saved in:
| Main Authors: | San-Yang Liu, Yuan-Yuan Huang, Hong-Wei Jiao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2014/305643 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Scaled Conjugate Gradient Method for Solving Monotone Nonlinear Equations with Convex Constraints
by: Sheng Wang, et al.
Published: (2013-01-01) -
Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Algorithm for Large-Scale Box-Constrained Optimization
by: Qiuyu Wang, et al.
Published: (2014-01-01) -
A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm
by: Ghada Moayid Al-Naemi, et al.
Published: (2023-12-01) -
On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method
by: Taksaporn Sirirut, et al.
Published: (2018-01-01) -
A modified two-term conjugate gradient-based projection algorithm for constrained nonlinear equations with applications
by: Yan Xia, et al.
Published: (2025-06-01)