Descent Property and Global Convergence of a New Search Direction Method for Unconstrained Optimization

DOI10.1080/01630563.2014.976796zbMath1316.90036OpenAlexW2162627626MaRDI QIDQ5251581

Mohammed Belloufi, Rachid Benzine

Publication date: 20 May 2015

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2014.976796

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodstrong Wolfe line search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10)

Related Items (1)

Global convergence properties of the BBB conjugate gradient method

Cites Work

• Unnamed Item
• Efficient generalized conjugate gradient algorithms. I: Theory
• A note on minimization problems and multistep methods
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• CUTE
• One-step and multistep procedures for constrained minimization problems
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• 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: Descent Property and Global Convergence of a New Search Direction Method for Unconstrained Optimization