A conjugate gradient method with sufficient descent property
From MaRDI portal
Publication:747726
DOI10.1007/S11075-014-9946-5zbMATH Open1327.90317OpenAlexW2002303885MaRDI QIDQ747726FDOQ747726
Xiaoyan Qian, Feng Rao, Hai-Jun Wang, Hao Liu
Publication date: 19 October 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9946-5
Recommendations
- A conjugate gradient method with sufficient descent property and its convergence property
- An efficient conjugate gradient method with sufficient descent property
- Two conjugate gradient methods with sufficient descent property
- A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization
- A modified three-term conjugate gradient method with sufficient descent property
Cites Work
- CUTE
- Numerical Optimization
- Benchmarking optimization software with performance profiles.
- Updating Quasi-Newton Matrices with Limited Storage
- Function minimization by conjugate gradients
- Scaled conjugate gradient algorithms for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- An unconstrained optimization test functions collection
- Technical Note—A Modified Conjugate Gradient Algorithm
- 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
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Title not available (Why is that?)
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- New quasi-Newton methods for unconstrained optimization problems
- A three-parameter family of nonlinear conjugate gradient methods
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
- Title not available (Why is that?)
- A survey of nonlinear conjugate gradient methods
- A modified BFGS method and its global convergence in nonconvex minimization
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- Conjugate Gradient Methods with Inexact Searches
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
Cited In (7)
- A new hybrid conjugate gradient algorithm with sufficient descent property
- Algorithm 851
- Title not available (Why is that?)
- Some sufficient descent conjugate gradient methods and their global convergence
- A globally convergent gradient-like method based on the Armijo line search
- New properties of a nonlinear conjugate gradient method
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
Uses Software
This page was built for publication: A 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 Q747726)
