New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization

DOI10.1016/j.cam.2010.05.002zbMath1407.65060OpenAlexW2156273800MaRDI QIDQ989146

Neculai Andrei

Publication date: 27 August 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.05.002

zbMATH Keywords

unconstrained optimizationconjugate gradient methodconjugacy conditionnumerical comparisonssufficient descent conditionNewton direction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items

A spectral conjugate gradient projection algorithm to solve the large-scale system of monotone nonlinear equations with application to compressed sensing, An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems, An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems, Spectral conjugate gradient methods for vector optimization problems, A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization, Riemannian conjugate gradient method for low-rank tensor completion, Unnamed Item, A new nonmonotone line search technique for unconstrained optimization, A spectral three-term Hestenes-Stiefel conjugate gradient method, The new spectral conjugate gradient method for large-scale unconstrained optimisation, A modified spectral conjugate gradient method with global convergence, Two classes of spectral conjugate gradient methods for unconstrained optimizations, Two spectral conjugate gradient methods for unconstrained optimization problems, A new spectral conjugate gradient method for large-scale unconstrained optimization

Uses Software

• L-BFGS
• CUTEr
• CONMIN
• Algorithm 500
• SCALCG
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the limited memory BFGS method for large scale optimization
• Acceleration of conjugate gradient algorithms for unconstrained optimization
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems
• Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
• Optimal conditioning of self-scaling variable Metric algorithms
• Restart procedures for the conjugate gradient method
• Conjugate Gradient Methods with Inexact Searches
• On the Convergence of a New Conjugate Gradient Algorithm
• CUTE
• Line search algorithms with guaranteed sufficient decrease
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• 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