Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization

DOI10.1007/s10957-013-0285-9zbMath1275.90090OpenAlexW2150968479MaRDI QIDQ382920

Neculai Andrei

Publication date: 22 November 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0285-9

zbMATH Keywords

unconstrained optimizationconjugacy conditionWolfe line searchconjugate gradientdescent condition

Mathematics Subject Classification ID

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

Related Items (14)

An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems ⋮ A subspace conjugate gradient algorithm for large-scale unconstrained optimization ⋮ Comments on ``Hybrid conjugate gradient algorithm for unconstrained optimization ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems ⋮ A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems ⋮ An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization ⋮ New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction ⋮ Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence ⋮ A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations ⋮ An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems ⋮ A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems ⋮ A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition

Uses Software

• L-BFGS
• CUTEr
• MINPACK-2
• Algorithm 500
• SCALCG

Cites Work

• Unnamed Item
• 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
• Numerical study of a relaxed variational problem from optimal design
• On a problem of the theory of lubrication governed by a variational inequality
• Mathematical problems from combustion theory
• Scaled conjugate gradient algorithms for unconstrained optimization
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• Technical Note—A Modified Conjugate Gradient Algorithm
• Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
• Conjugate Gradient Methods with Inexact Searches
• Line search algorithms with guaranteed sufficient decrease
• A Subspace Study on Conjugate Gradient Algorithms
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• Convergence Conditions for Ascent Methods
• 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
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization

This page was built for publication: Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization