A modified hybrid conjugate gradient method for unconstrained optimization
From MaRDI portal
Summary: The nonlinear conjugate gradient algorithms are a very effective way in solving large-scale unconstrained optimization problems. Based on some famous previous conjugate gradient methods, a modified hybrid conjugate gradient method was proposed. The proposed method can generate decent directions at every iteration independent of any line search. Under the Wolfe line search, the proposed method possesses global convergence. Numerical results show that the modified method is efficient and robust.
Recommendations
- A modified conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
- A new hybrid conjugate gradient method for unconstrained optimization
- A new hybrid conjugate gradient method for unconstrained optimization
- A new hybrid conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimisation
- Another hybrid conjugate gradient method for unconstrained optimization problems
- Hybrid conjugate gradient methods for unconstrained optimization
- A new hybrid conjugate gradient method of unconstrained optimization methods
Cites work
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A note about WYL's conjugate gradient method and its applications
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- Benchmarking optimization software with performance profiles.
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 6129033 (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 hybrid conjugate gradient method as a convex combination of LS and FR methods
- Testing Unconstrained Optimization Software
- The conjugate gradient method in extremal problems
- The convergence properties of some new conjugate gradient methods
- The global convergence of a mixed conjugate gradient method with the Wolfe line search
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- Two conjugate gradient methods with sufficient descent property
- Two mixed conjugate gradient methods based on DY
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
Cited in
(14)- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- A modified trust region method with beale's PCG technique for optimization
- A modified conjugate gradient method based on the self-scaling memoryless BFGS update
- Some modified conjugate gradient methods for unconstrained optimization
- A mixed conjugate gradient method for unconstrained optimization
- A new hybrid conjugate gradient algorithm for unconstrained optimization
- Two modified conjugate gradient methods for solving unconstrained optimization and application
- A modified nonlinear conjugate gradient algorithm for unconstrained optimization and portfolio selection problems
- A modified spectral gradient projection-based algorithm for large-scale constrained nonlinear equations with applications in compressive sensing
- Application of a globally convergent hybrid conjugate gradient method in portfolio optimization
- A modified bat algorithm with conjugate gradient method for global optimization
This page was built for publication: A modified hybrid conjugate gradient method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2034936)
