A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
From MaRDI portal
Publication:3111146
DOI10.1080/02331931003653187zbMATH Open1233.90255OpenAlexW1978386996MaRDI QIDQ3111146FDOQ3111146
Authors: Neculai Andrei 
Publication date: 18 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331931003653187
Recommendations
- A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- A modified projected conjugate gradient algorithm for unconstrained optimization problems
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- Global convergence of a modified PRP conjugate gradient method and its numerical results
conjugacy conditionnumerical comparisonsunconstrained optimizationsufficient descent conditionPolak-Ribière-Polyak conjugate gradient method
Cites Work
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- On the limited memory BFGS method for large scale optimization
- Title not available (Why is that?)
- Function minimization by conjugate gradients
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- A conjugate direction algorithm without line searches
- Scaled conjugate gradient algorithms for unconstrained optimization
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Restart procedures for the conjugate gradient method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- The conjugate gradient method in extremal problems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- On restart procedures for the conjugate gradient method
Cited In (27)
- A modified three-term conjugate gradient method with sufficient descent property
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- Two classes of spectral three-term derivative-free method for solving nonlinear equations with application
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method
- Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization
- Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- Some three-term conjugate gradient methods with the new direction structure
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Spectral three-term constrained conjugate gradient algorithm for function minimizations
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- A modified projected conjugate gradient algorithm for unconstrained optimization problems
- A new three-term conjugate gradient algorithm for unconstrained optimization
- On three-term conjugate gradient algorithms for unconstrained optimization
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
- Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method
Uses Software
This page was built for publication: A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111146)
