A survey of sufficient descent conjugate gradient methods for unconstrained optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7109378
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization
- A conjugate gradient method with sufficient descent property
- An efficient conjugate gradient method with sufficient descent property
Cited in
(20)- Sufficient descent Riemannian conjugate gradient methods
- Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications
- A study of Liu-Storey conjugate gradient methods for vector optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- A survey of gradient methods for solving nonlinear optimization
- PRP-like algorithm for monotone operator equations
- Riemannian conjugate gradient methods: general framework and specific algorithms with convergence analyses
- scientific article; zbMATH DE number 7109378 (Why is no real title available?)
- On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications
- Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization
- On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- A family of limited memory three term conjugate gradient methods
- An efficient Dai-Kou-type method with image de-blurring application
- A unified framework for solving ill-posed problems using regularized conjugate gradient, Broyden-Fletcher-Goldfarb-Shanno (BFGS), and limited-memory BFGS
- Two RMIL-type schemes with compressed sensing applications
- The Dai–Liao-type conjugate gradient methods for solving vector optimization problems
- A vector restricted variant MVHS+ CG method based algorithm for unconstrained vector optimization problems
- Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems
This page was built for publication: A survey of sufficient descent conjugate gradient methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500361)
