An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
From MaRDI portal
Publication:3453426
DOI10.1080/02331934.2014.984706zbMath1327.90303OpenAlexW1986346454MaRDI QIDQ3453426
Publication date: 27 November 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.984706
Related Items (2)
A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function ⋮ A derivative-free three-term projection algorithm involving spectral quotient for solving nonlinear monotone equations
Cites Work
- On three-term conjugate gradient algorithms for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
- New cautious BFGS algorithm based on modified Armijo-type line search
- New spectral PRP conjugate gradient method for unconstrained optimization
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- A conjugate direction algorithm without line searches
- A three-parameter family of nonlinear conjugate gradient methods
- A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS
- A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Algorithm 851
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- New BFGS method for unconstrained optimization problem based on modified Armijo line search
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
This page was built for publication: An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
