Related Articles ( Unconstrained )
A New Parameter Conjugate Gradient Method Based on Three Terms Unconstrained Optimization
In this paper, we suggest a new conjugate gradient method for solving nonlinear unconstrained optimization problems by using three term conjugate gradient method, We give a descent condition and the sufficient descent condition of the suggested method.
A new class of three-term conjugate gradient methods for solving unconstrained minimization problems
Conjugate gradient (CG) methods which are usually generate descent search directions, are beneficial for large-scale unconstrained optimization models, because of its low memory requirement and simplicity. This paper studies the three-term CG method for unconstrained optimization. The modified a three-term ...
DHO conjugate gradient method for unconstrained optimization
In this paper, we suggest a new coefficient conjugate gradient method for nonlinear unconstrained optimization by using two parameters one of them is parameter of (FR) and the other one is parameter of (CD), we give a descent condition of the suggested method.
A new self-scaling variable metric (DFP) method for unconstrained optimization problems
In this study, a new self-scaling variable metric (VM)-updating method for solving nonlinear unconstrained optimization problems is presented. The general strategy of (New VM-updating) is to propose a new quasi-newton condition used for update the usual DFP Hessian to a number of times in a way to be ...
Optimal models for estimating future infected cases of COVID-19 in Oman
The recent coronavirus disease 2019 (COVID-19) outbreak is of high importance in research topics due to its fast spreading and high rate of infections across the world. In this paper, we test certain optimal models of forecasting daily new cases of COVID-19 in Oman. It is based on solving a certain nonlinear ...
A New conjugate gradient method for unconstrained optimization problems with descent property
In this paper, we propose a new conjugate gradient method for solving nonlinear unconstrained optimization. The new method consists of three parts, the first part of them is the parameter of Hestenes-Stiefel (HS). The proposed method is satisfying the descent condition, sufficient descent condition and ...
Global convergence of new three terms conjugate gradient for unconstrained optimization
n this paper, a new formula of 𝛽𝑘 is suggested for the conjugate gradient method of solving unconstrained optimization problems based on three terms and step size of cubic. Our new proposed CG method has descent condition, sufficient descent condition, conjugacy condition, and global convergence properties. ...
A New Coefficient of Conjugate Gradient Method with Global Convergence for Unconstrained Optimization Problems
In this article, we defined a new coefficient formula of the conjugate gradient method for solving non linear unconstrained optimization problems. The new formula β new k is type of line search and the idea of our work is to focus on modification the Perry’s suggestion. We further show that ...
Conjugated Gradient with Four Terms for Nonlinear Unconstrained Optimization
The nonlinear conjugate gradient (GJG) technique is an effective tool for addressing minimization on a huge scale. It can be used in a variety of applications., We presented a novel conjugate gradient approach based on two hypotheses, and we equalized the two hypotheses and retrieved the good parameter ...