New conjugate gradient formula for unconstrained optimization

In order to solve an unconstrained optimization problem, this paper introduces new conjugate gradient formula(CGM) Which is achieved for two properties first the conjugate property and secondly the descent property. The objective function is differentiable, and the gradient—the objective function’s...

Full description

Saved in:
Bibliographic Details
Main Authors: Ahmed, Zainab Shehab, Mahmood, Saad Shakir
Format: Conference Proceeding
Language:English
Subjects:
Optimization
Parameters
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In order to solve an unconstrained optimization problem, this paper introduces new conjugate gradient formula(CGM) Which is achieved for two properties first the conjugate property and secondly the descent property. The objective function is differentiable, and the gradient—the objective function’s first derivative—is Lipchitz continuous. Using a different parameter is a new parameter acting a coefficient of the goal function’s subsequent gradient, To Determines the new direction based on the previous one confirm the efficacy of the new CDM, We presented the results of our new method using MATLAB application, according to table with the total iterations and a function evaluation is used to present our findings.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0197762