A modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimization

DOI10.1080/10556788.2012.755182zbMath1282.90183OpenAlexW1991360534MaRDI QIDQ5746691

Juan Liu, Min Li, Aiping Qu, Yue Xiao

Publication date: 7 February 2014

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2012.755182

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodsufficient descent property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

A novel method of dynamic force identification and its application

Cites Work

• Unnamed Item
• Efficient generalized conjugate gradient algorithms. I: Theory
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Restart procedures for the conjugate gradient method
• CUTE
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• A Two-Term PRP-Based Descent Method
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.

This page was built for publication: A modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimization