Dai-Kou type conjugate gradient methods with a line search only using gradient

DOI10.1186/S13660-017-1341-ZMaRDI QIDQ522525zbMATH OpenOpenAlexWikidataFDO

Authors Yuanyuan Huang, Changhe Liu

Publication date 18 April 2017

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s13660-017-1341-z

zbMATH Keywords

global convergenceunconstrained optimizationnumerical testoptimality conditionline searchsufficient descent conditionDai-Kou type conjugate gradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
• A new Dai-Liao type of conjugate gradient algorithm for unconstrained optimization problems
• Convergence of the descent Dai-Yuan conjugate gradient method for unconstrained optimization

Cites work

• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 1306984 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• 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 class of derivative-free methods for large-scale nonlinear monotone equations
• A globally convergent derivative-free method for solving large-scale nonlinear monotone equations
• A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization
• A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
• A practical PR+ conjugate gradient method only using gradient
• Algorithm 851
• Benchmarking optimization software with performance profiles.
• CUTE
• CUTEr and SifDec
• Convergence Properties of Algorithms for Nonlinear Optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization
• Nonsmooth optimization via quasi-Newton methods
• Numerical experience with Newton-like methods for nonlinear algebraic systems
• The conjugate gradient method in extremal problems

Cited in

(5)

• A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
• An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
• Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy
• Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems

Describes a project that uses

Uses Software

• CUTEr
• SIFDecode
• CG_DESCENT
• CUTE

This page was built for publication: Dai-Kou type conjugate gradient methods with a line search only using gradient

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