An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems

DOI10.1080/02331934.2014.984706MaRDI QIDQ3453426zbMATH OpenOpenAlexFDO

Authors Songhai Deng, Zhong Wan

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

zbMATH Keywords

optimizationalgorithmsglobal convergenceconjugate gradient method

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Nonlinear programming (90C30)

Recommendations

• A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
• A new three-term conjugate gradient algorithm for unconstrained optimization
• A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
• A new Dai-Liao type of conjugate gradient algorithm for unconstrained optimization problems
• An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization

Cites work

• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Two-Term PRP-Based Descent Method
• A conjugate direction algorithm without line searches
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
• A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
• A modified projected conjugate gradient algorithm for unconstrained optimization problems
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A three-parameter family of nonlinear conjugate gradient methods
• Algorithm 851
• 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
• Benchmarking optimization software with performance profiles.
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• New BFGS method for unconstrained optimization problem based on modified armijo line search
• New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
• New cautious BFGS algorithm based on modified Armijo-type line search
• New conjugacy conditions and related nonlinear conjugate gradient methods
• New spectral PRP conjugate gradient method for unconstrained optimization
• On three-term conjugate gradient algorithms for unconstrained optimization
• Some descent three-term conjugate gradient methods and their global convergence

Cited in

(9)

• A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
• A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
• scientific article; zbMATH DE number 7014239 (Why is no real title available?)
• A new Dai-Liao type of conjugate gradient algorithm for unconstrained optimization problems
• A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
• A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
• A new three-term conjugate gradient algorithm for unconstrained optimization
• 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

This page was built for publication: An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453426)