Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
From MaRDI portal
(Redirected from Publication:645035)
Recommendations
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation
- Two modified hybrid conjugate gradient methods based on a hybrid secant equation
- Hybrid conjugate gradient methods for unconstrained optimization
- A class hybrid conjugate gradient methods
- Hybrid conjugate gradient algorithm for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 766480 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A Modified BFGS Algorithm for Unconstrained Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- A spectral conjugate gradient method for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence result for conjugate gradient methods
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Methods of conjugate gradients for solving linear systems
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- New properties of a nonlinear conjugate gradient method
- New quasi-Newton equation and related methods for unconstrained optimization
- Notes on the Dai-Yuan-Yuan modified spectral gradient method
- Optimization theory and methods. Nonlinear programming
- The conjugate gradient method in extremal problems
- Two-Point Step Size Gradient Methods
Cited in
(23)- A new conjugate gradient method with an efficient memory structure
- Two modified hybrid conjugate gradient methods based on a hybrid secant equation
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- A hybridization of the Hestenes-Stiefel and Dai-Yuan conjugate gradient methods based on a least-squares approach
- Two modified scaled nonlinear conjugate gradient methods
- A modified Perry conjugate gradient method and its global convergence
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization
- A modified BFGS algorithm based on a hybrid secant equation
- Two new conjugate gradient methods based on modified secant equations
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- An improved spectral CG method based on Dai–Liao conjugacy condition and quasi-Newton direction
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- An extended version of the memoryless DFP algorithm with the sufficient descent property
- Hybrid conjugate gradient methods based on an extended least-squares model
- An efficient matrix free optimization algorithm combining a revised PRP and FR-CG type methods with application to robotics
- An augmented memoryless Davidon–Fletcher–Powell method based on the Dai–Liao approach
- A limited memory descent Perry conjugate gradient method
- A new hybrid three-term LS-CD conjugate gradient in solving unconstrained optimization problems
- A descent family of hybrid conjugate gradient methods with global convergence property for nonconvex functions
This page was built for publication: Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645035)
