A spectral dai-yuan-type conjugate gradient method for unconstrained optimization
Summary: A new spectral conjugate gradient method (SDYCG) is presented for solving unconstrained optimization problems in this paper. Our method provides a new expression of spectral parameter. This formula ensures that the sufficient descent condition holds. The search direction in the SDYCG can be viewed as a combination of the spectral gradient and the Dai-Yuan conjugate gradient. The global convergence of the SDYCG is also obtained. Numerical results show that the SDYCG may be capable of solving large-scale nonlinear unconstrained optimization problems.
- A new spectral conjugate gradient method
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- New spectral PRP conjugate gradient method for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A spectral conjugate gradient method for unconstrained optimization
- A spectral DY-type projection method for nonlinear monotone system of equations
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Function minimization by conjugate gradients
- Global convergence of a modified spectral FR conjugate gradient method
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The conjugate gradient method in extremal problems
- Two-Point Step Size Gradient Methods
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- A mixed spectral CD-DY conjugate gradient method
- Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
- A Modification of Dai-Yuan's Conjugate Gradient Algorithm for Solving Unconstrained Optimization
- A new spectral conjugate gradient method
- Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition
This page was built for publication: A spectral dai-yuan-type 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 Q1666716)