An efficient FR-CD-like algorithm for unconstrained optimization

DOI10.61882/IJMSI.21.1.67MaRDI QIDQ7307288zbMATH OpenFDO

Authors Jitsupa Deepho, Auwal Bala Abubakar, Maulana Malik, Abdulkarim Hassan Ibrahim, Aliyu Ibrahim Kiri

Publication date 31 July 2026

Published in Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.61882/IJMSI.21.1.67

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cites work

• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
• A literature survey of benchmark functions for global optimisation problems
• A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A survey of nonlinear conjugate gradient methods
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
• Algorithm 851
• Benchmarking optimization software with performance profiles.
• Conjugate Gradient Methods with Inexact Searches
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Function minimization by conjugate gradients
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Methods of conjugate gradients for solving linear systems
• New hybrid conjugate gradient method for unconstrained optimization
• Nonlinear conjugate gradient methods for unconstrained optimization
• Optimization theory and methods. Nonlinear programming
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
• Some three-term conjugate gradient methods with the inexact line search condition
• Updating Quasi-Newton Matrices with Limited Storage

This page was built for publication: An efficient FR-CD-like algorithm for unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307288)