A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
From MaRDI portal
Publication:354989
DOI10.1007/S11071-012-0694-6zbMATH Open1268.65066OpenAlexW2048794991MaRDI QIDQ354989FDOQ354989
Publication date: 22 July 2013
Published in: Nonlinear Dynamics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11071-012-0694-6
Numerical methods for variational inequalities and related problems (65K15) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing Unconstrained Optimization Software
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- 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
- Efficient generalized conjugate gradient algorithms. I: Theory
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- A new version of the Liu-Storey conjugate gradient method
- Multi-objective global optimal parafoil homing trajectory optimization via Gauss pseudospectral method
- Two modified HS type conjugate gradient methods for unconstrained optimization problems
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
Cited In (20)
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems
- Title not available (Why is that?)
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- An effective inertial-relaxed CGPM for nonlinear monotone equations
- Some improved Dai-Yuan conjugate gradient methods for large-scale unconstrained optimization problems
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration
- A New Formula on the Conjugate Gradient Method for Removing Impulse Noise Images
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- A modified hybrid conjugate gradient method for unconstrained optimization
- A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations
- Maximum likelihood gradient-based iterative estimation algorithm for a class of input nonlinear controlled autoregressive ARMA systems
- Real-time pricing method for smart grid based on social welfare maximization model
- A novel method of dynamic force identification and its application
- A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems
Uses Software
This page was built for publication: A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354989)
