Globally convergence of nonlinear conjugate gradient method for unconstrained optimization

DOI10.1051/RO/2017028zbMath1398.65129OpenAlexW2606479691MaRDI QIDQ4578161

Y. Chaib, Mohammed Belloufi, Badreddine Sellami

Publication date: 8 August 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017028

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodline search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Combinatorial optimization (90C27)

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of globally convergent conjugate gradient methods
• Global convergence result for 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
• Convergence properties of the Fletcher-Reeves method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A new two-parameter family of nonlinear conjugate gradient methods
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• Benchmarking optimization software with performance profiles.

This page was built for publication: Globally convergence of nonlinear conjugate gradient method for unconstrained optimization