On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method
Recently, Zhang et al. proposed a sufficient descent Polak-Ribière-Polyak (SDPRP) conjugate gradient method for large-scale unconstrained optimization problems and proved its global convergence in the sense that lim infk→∞∥∇f(xk)∥=0 when an Armijo-type line search is used. In this paper, motivated b...
Saved in:
Main Authors: | Min Sun, Jing Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/283215 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Extension of Modified Polak-Ribière-Polyak Conjugate Gradient Method to Linear Equality Constraints Minimization Problems
by: Zhifeng Dai
Published: (2014-01-01) -
A New Modified Three-Term Conjugate Gradient Method with Sufficient Descent Property and Its Global Convergence
by: Bakhtawar Baluch, et al.
Published: (2017-01-01) -
Short Paper - Quadratic minimization: from conjugate gradient to an adaptive Polyak’s momentum method with Polyak step-sizes
by: Goujaud, Baptiste, et al.
Published: (2024-11-01) -
Several Guaranteed Descent Conjugate Gradient Methods for Unconstrained Optimization
by: San-Yang Liu, et al.
Published: (2014-01-01) -
Strong Convergence of a Projected Gradient Method
by: Shunhou Fan, et al.
Published: (2012-01-01)