Dai-Kou type conjugate gradient methods with a line search only using gradient
From MaRDI portal
Publication:522525
DOI10.1186/S13660-017-1341-ZzbMATH Open1362.65062OpenAlexW2604655597WikidataQ37737610 ScholiaQ37737610MaRDI QIDQ522525FDOQ522525
Publication date: 18 April 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1341-z
global convergenceunconstrained optimizationnumerical testoptimality conditionline searchsufficient descent conditionDai-Kou type conjugate gradient methods
Cites Work
- Algorithm 851
- CUTEr and SifDec
- CUTE
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- Title not available (Why is that?)
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- Title not available (Why is that?)
- A class of derivative-free methods for large-scale nonlinear monotone equations
- Title not available (Why is that?)
- Nonsmooth optimization via quasi-Newton methods
- A practical PR+ conjugate gradient method only using gradient
- Convergence Properties of Algorithms for Nonlinear Optimization
- Title not available (Why is that?)
- A globally convergent derivative-free method for solving large-scale nonlinear monotone equations
- Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization
- Numerical experience with Newton-like methods for nonlinear algebraic systems
Cited In (4)
- A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
- Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy
Uses Software
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 👍 👎
- Title not available (Why is that?) 👍 👎
- Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization 👍 👎
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)
