Sufficient descent conjugate gradient methods for large-scale optimization problems
From MaRDI portal
Recommendations
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- An efficient conjugate gradient method with sufficient descent property
- scientific article; zbMATH DE number 7109378
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- scientific article; zbMATH DE number 5845974
Cites work
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Benchmarking optimization software with performance profiles.
- 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 properties of nonlinear conjugate gradient methods with modified secant condition
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3363347 (Why is no real title available?)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Restart procedures for the conjugate gradient method
- Testing Unconstrained Optimization Software
Cited in
(10)- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- On the sufficient descent property of the Shanno's conjugate gradient method
- Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
- A mixed conjugate gradient method for large scale problems
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- An efficient conjugate gradient method with sufficient descent property
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- Convex constrained optimization for large-scale generalized Sylvester equations
- On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application
This page was built for publication: Sufficient descent conjugate gradient methods for large-scale optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885559)
