Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
From MaRDI portal
Publication:2129100
Cites work
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3397320 (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 globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
- A globally convergent modified multivariate version of the method of moving asymptotes
- A globally convergent modified version of the method of moving asymptotes
- An efficient modified Polak-Ribière-Polyak conjugate gradient method with global convergence properties
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- Benchmarking optimization software with performance profiles.
- CUTE
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- The Limited Memory Conjugate Gradient Method
- The convergence properties of some new conjugate gradient methods
This page was built for publication: Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129100)