Abstract
In this article, we propose a new conjugate gradient type formula for computing unconstrained optimization problems. Its form is similar to the original PRP formula and it inherits all nice properties of the PRP method. By utilizing the technique of the three-term PRP method in Zhang [20] and modified PRP method in Yu [17], we propose two modified methods of the new formula. The two modified methods all can generate sufficient descent directions which is independent of the line search used. Under some mild conditions, the global convergence and the linearly convergent rate of the two modified methods are established. The numerical results show that the proposed methods are efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
