A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems

DOI10.1155/2020/4381515MaRDI QIDQ2007335zbMATH OpenOpenAlexFDO

Authors Zhan Wang, Pengyuan Li, Xiangrong Li, Hongtruong Pham

Publication date 13 October 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/4381515

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Methods of reduced gradient type (90C52)

Recommendations

• Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
• Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization
• A three-term method for unconstrained optimization
• Some three-term conjugate gradient methods for solving unconstrained optimization problems
• On three-term conjugate gradient algorithms for unconstrained optimization

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm
• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
• A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
• Benchmarking optimization software with performance profiles.
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Efficient generalized conjugate gradient algorithms. I: Theory
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• Function minimization by conjugate gradients
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
• Methods of conjugate gradients for solving linear systems
• Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
• The conjugate gradient method in extremal problems
• The global convergence of a modified BFGS method for nonconvex functions
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions

Cited in

(3)

• Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
• Generalized RMIL conjugate gradient method under the strong Wolfe line search with application in image processing
• A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection

This page was built for publication: A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems

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