Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method

DOI10.1007/s10957-006-9123-7zbMath1145.90070OpenAlexW2058895639MaRDI QIDQ933809

Paul Armand

Publication date: 25 July 2008

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-006-9123-7

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (2)

A Mathematical and Computational Proposal for the Development of Tight-Binding Order-N Density Matrix Methodology ⋮ Parallel two-phase methods for global optimization on GPU

Uses Software

• CUTEr
• SifDec
• Algorithm 500

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient line search for nonlinear least squares
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A piecewise line-search technique for maintaining the positive definiteness of the matrices in the SQP method
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
• Numerical Optimization
• Line search algorithms with guaranteed sufficient decrease
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Convergence properties of the Fletcher-Reeves method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
• Function minimization by conjugate gradients
• CUTEr and SifDec
• The conjugate gradient method in extremal problems

This page was built for publication: Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method