A modified Polak-Ribière-Polyak descent method for unconstrained optimization

DOI10.1080/10556788.2012.755182MaRDI QIDQ5746691zbMATH OpenOpenAlexFDO

Authors Aiping Qu, Min Li, Yue Xiao, Juan Liu

Publication date 7 February 2014

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

conjugate gradient methodglobal convergencesufficient descent propertyunconstrained optimization

Mathematics Subject Classification ID

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

Recommendations

• A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Global convergence of a modified PRP conjugate gradient method and its numerical results
• Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
• A conjugate gradient method with descent direction for unconstrained optimization

Cites work

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

Cited in

(8)

• A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
• A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• A novel method of dynamic force identification and its application
• A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A modified CG-DESCENT method for unconstrained optimization
• \(n\)-step quadratic convergence of the MPRP method with a restart strategy

This page was built for publication: A modified Polak-Ribière-Polyak descent method for unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746691)