A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
From MaRDI portal
Publication:1937015
DOI10.1007/s10957-012-0016-7zbMath1256.90050MaRDI QIDQ1937015
Publication date: 11 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0016-7
unconstrained optimization; global convergence; large-scale optimization; conjugate gradient algorithm; line search
Related Items
A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ∞ matrix norm, An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization, Addendum to: A hybrid conjugate gradient method based on a quadratic relaxation of Dai–Yuan hybrid conjugate gradient parameter, Comments on “A hybrid conjugate gradient method based on a quadratic relaxation of the Dai-Yuan hybrid conjugate gradient parameter”, A descent family of Dai–Liao conjugate gradient methods, A modified scaling parameter for the memoryless BFGS updating formula, A modified three-term conjugate gradient method with sufficient descent property, On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae, Comments on ``Hybrid conjugate gradient algorithm for unconstrained optimization, A note on the global convergence of the quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods, A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods, A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization, A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization, A modified scaled memoryless symmetric rank-one method, A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- Two new conjugate gradient methods based on modified secant equations
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Global convergence result for conjugate gradient methods
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Conjugate gradient methods with Armijo-type line searches.
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Optimization theory and methods. Nonlinear programming
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- A note on global convergence result for conjugate gradient methods
- A Modified BFGS Algorithm for Unconstrained Optimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Restart procedures for the conjugate gradient method
- Convergence properties of the Fletcher-Reeves method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- CUTEr and SifDec
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- A modified BFGS method and its global convergence in nonconvex minimization
- New properties of a nonlinear conjugate gradient method
- Benchmarking optimization software with performance profiles.
- An efficient hybrid conjugate gradient method for unconstrained optimization
