Some three-term conjugate gradient methods for solving unconstrained optimization problems

MaRDI QIDQ5151643zbMATH OpenFDO

Authors

Publication date 22 February 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/PJO/vol16/pjov16n3p461.pdf

zbMATH Keywords

inexact line searchnumerical comparisonssufficient descent conditionthree-term conjugate gradient methodunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
• A new three-term conjugate gradient method with descent direction for unconstrained optimization
• Some three-term conjugate gradient methods with the new direction structure
• Three-term conjugate gradient methods based on secant conditions for unconstrained optimization

Cited in

(17)

• On three-term conjugate gradient algorithms for unconstrained optimization
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
• Modified three-term conjugate gradient method and its applications
• Some three-term conjugate gradient methods with the new direction structure
• A three-term method for unconstrained optimization
• A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• Three-term conjugate gradient methods based on secant conditions for unconstrained optimization
• A new three-term conjugate gradient method with descent direction for unconstrained optimization
• Comparison between BZAU, SRMI and MRM conjugate gradient methods in minimization problems
• A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice
• Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
• A family of limited memory three term conjugate gradient methods
• A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
• Some three-term conjugate gradient methods with the inexact line search condition
• Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems

This page was built for publication: Some three-term conjugate gradient methods for solving unconstrained optimization problems

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