A spectral KRMI conjugate gradient method under the strong-Wolfe line search

DOI10.1063/1.4952552zbMath1468.90147OpenAlexW2503374157MaRDI QIDQ4989293

Mustafa Mamat, Ibrahim Jusoh, Wan Khadijah, Mohd Rivaie

Publication date: 21 May 2021

Published in: AIP Conference Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.4952552

zbMATH Keywords

unconstrained optimization problems, inexact line searches, global convergence

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cites Work

• A literature survey of benchmark functions for global optimisation problems
• Global convergence of a spectral conjugate gradient method for unconstrained optimization
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Minimization of functions having Lipschitz continuous first partial derivatives
• Testing Unconstrained Optimization Software
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Modified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimization
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• On Steepest Descent
• A spectral conjugate gradient method for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item

This page was built for publication: A spectral KRMI conjugate gradient method under the strong-Wolfe line search