A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization

DOI10.1016/j.aml.2007.05.002zbMath1165.90683OpenAlexW2090192300MaRDI QIDQ2469707

Neculai Andrei

Publication date: 7 February 2008

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2007.05.002

zbMATH Keywords

unconstrained optimizationconjugate gradient methodconjugacy conditionnumerical comparisonssufficient descent condition

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (17)

A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ A new descent memory gradient method and its global convergence ⋮ Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property ⋮ A spectral conjugate gradient method for solving large-scale unconstrained optimization ⋮ Global convergence of some modified PRP nonlinear conjugate gradient methods ⋮ Estimation of boundary condition of two-dimensional nonlinear PDE with application to continuous casting ⋮ A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems ⋮ Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ Two Modified Polak–Ribière–Polyak-Type Nonlinear Conjugate Methods with Sufficient Descent Property ⋮ Nonlinear conjugate gradient methods for continuous-time output feedback design ⋮ Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization ⋮ Two modified Dai-Yuan nonlinear conjugate gradient methods ⋮ Computer Algebra and Line Search ⋮ Penalty algorithm based on conjugate gradient method for solving portfolio management problem ⋮ A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing ⋮ A new spectral conjugate gradient method for large-scale unconstrained optimization

Uses Software

• CUTEr
• Algorithm 500
• SCALCG
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• A New Variational Result for Quasi-Newton Formulae
• Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
• CUTE
• A family of hybrid conjugate gradient methods for unconstrained optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• A spectral conjugate gradient method for unconstrained optimization
• New properties of a nonlinear conjugate gradient method
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization

This page was built for publication: A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization