Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization

DOI10.1155/2014/394096zbMath1407.90349OpenAlexW2160071131WikidataQ59064982 ScholiaQ59064982MaRDI QIDQ1718269

Zhongbo Sun, Yan-Tao Tian, Hong-yang Li

Publication date: 8 February 2019

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

Full work available at URL: https://doi.org/10.1155/2014/394096

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items

A novel projected Fletcher‐Reeves conjugate gradient approach for finite‐time optimal robust controller of linear constraints optimization problem: Application to bipedal walking robots

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On three-term conjugate gradient algorithms for unconstrained optimization
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• A modified conjugacy condition and related nonlinear conjugate gradient method
• A hybrid of DL and WYL nonlinear conjugate gradient methods
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Testing Unconstrained Optimization Software
• 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
• 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 modified BFGS method and its global convergence in nonconvex minimization
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization
• On the nonmonotone line search

This page was built for publication: Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization