scientific article

zbMath1476.65096MaRDI QIDQ3383959

R. M. Odekunle, A. A. Danhausa, A. S. Onanaye

Publication date: 16 December 2021

Full work available at URL: https://ojs.ictp.it/jnms/index.php/jnms/article/view/452

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

global convergencespectral conjugate gradient methodunconstrained minimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient generalized conjugate gradient algorithms. I: Theory
• New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
• A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization
• Two-Point Step Size Gradient Methods
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A new spectral conjugate gradient method for large-scale unconstrained optimization
• A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• A spectral conjugate gradient method for unconstrained optimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: