A modified conjugate gradient method based on a modified secant equation
From MaRDI portal
Recommendations
- A modified conjugate gradient method for unconstrained optimization
- A conjugate gradient method based on a modified secant relation for unconstrained optimization
- Two new conjugate gradient methods based on modified secant equations
- A modified conjugate gradient method based on the self-scaling memoryless BFGS update
- A new conjugate gradient method based on the modified BFGS formula
Cites work
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified Hestenes-Stiefel conjugate gradient method with an optimal property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Benchmarking optimization software with performance profiles.
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
- Convergence Properties of the BFGS Algoritm
- CUTEr and SifDec
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New quasi-Newton equation and related methods for unconstrained optimization
- Numerical Optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Self-Scaling Variable Metric (SSVM) Algorithms
- The BFGS method with exact line searches fails for non-convex objective functions
- The conjugate gradient method in extremal problems
Cited in
(14)- Guaranteed descent conjugate gradient methods with modified secant condition
- A class of accelerated conjugate-gradient-like methods based on a modified secant equation
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- Local and superlinear convergence of quasi-Newton methods based on modified secant conditions
- A class of modified secant methods for unconstrained optimization
- A modified secant equation quasi-Newton method for unconstrained optimization
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- A conjugate gradient method with quasi-Newton approximation
- A modified conjugate gradient method for unconstrained optimization
- A conjugate gradient method based on a modified secant relation for unconstrained optimization
- Using a modied secant equation for unconstrained optimization
- Modified secant-type methods for unconstrained optimization
- A new conjugate gradient algorithm for training neural networks based on a modified secant equation
- Two new conjugate gradient methods based on modified secant equations
This page was built for publication: A modified conjugate gradient method based on a modified secant equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855677)
