New conjugate gradient method for unconstrained optimization
From MaRDI portal
Publication:2954367
DOI10.1051/ro/2015064zbMath1357.65076OpenAlexW2325251790MaRDI QIDQ2954367
Publication date: 12 January 2017
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2015064
unconstrained optimizationglobal convergenceconjugate gradient methodline searchnumerical resultlarge-scale
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Combinatorial optimization (90C27)
Uses Software
Cites Work
- A class of globally convergent conjugate gradient methods
- Global convergence result for conjugate gradient methods
- A three-parameter family of nonlinear conjugate gradient methods
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Conjugate Gradient Methods with Inexact Searches
- CUTE
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A new two-parameter family of nonlinear conjugate gradient methods
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New conjugate gradient method for unconstrained optimization