In this paper, We propose a new nonlinear conjugate gradient method (FRA) that satisfies a sufficient descent condition and global convergence under the inexact line search of strong wolf powell. Our numerical experiment shaw the efficiency of the new method in solving a set of problems from the CUTEst package, the proposed new formula gives excellent numerical results at CPU time, number of iterations, number of gradient ratings when compared to WYL, DY, PRP, and FR methods
[EN] Thesemilocal and local convergence analyses of a two-step iterative method for nonlinear nondif...
We consider the global error bound for the generalized nonlinear complementarity problem over a poly...
A novel family of numerical integration of closed Newton-Cotes quadrature rules is presented which u...
Conjugate Gradient (CG) method is a technique used in solving nonlinear unconstrained optimization p...
The nonlinear matrix equation was solved by Gao (2016) via standard fixed point method. In th...
In Twenty century, Partial Differential Equations (PDE) are solved by Numerical Approach such as Ada...
This paper, proposes a new conjugate gradient method for unconstrained optimization based on Dai-Lia...
It is generally known that almost all filled function methods for one-dimensional unconstrained glob...
One of the great triumphs in the history of numerical methods was the discovery of the Conjugate Gra...
A modified spectral methods for solving unconstrained optimization problems based on the formulae ar...
This work proposes new fourth-order iterative methods to solve non-linear equations . The ite...
In the following manuscript we will show as a starting point a theoretical analysis of the gradient ...
In this paper, the iterative method, proposed by Gejji and Jafari in 2006, has been modified for sol...
In recent years nonlinear problems have several methods to be solved and utilize a well-known analyt...
Parabolic interface problems have many applications in physics and biology, such as hyperthermia tre...
[EN] Thesemilocal and local convergence analyses of a two-step iterative method for nonlinear nondif...
We consider the global error bound for the generalized nonlinear complementarity problem over a poly...
A novel family of numerical integration of closed Newton-Cotes quadrature rules is presented which u...
Conjugate Gradient (CG) method is a technique used in solving nonlinear unconstrained optimization p...
The nonlinear matrix equation was solved by Gao (2016) via standard fixed point method. In th...
In Twenty century, Partial Differential Equations (PDE) are solved by Numerical Approach such as Ada...
This paper, proposes a new conjugate gradient method for unconstrained optimization based on Dai-Lia...
It is generally known that almost all filled function methods for one-dimensional unconstrained glob...
One of the great triumphs in the history of numerical methods was the discovery of the Conjugate Gra...
A modified spectral methods for solving unconstrained optimization problems based on the formulae ar...
This work proposes new fourth-order iterative methods to solve non-linear equations . The ite...
In the following manuscript we will show as a starting point a theoretical analysis of the gradient ...
In this paper, the iterative method, proposed by Gejji and Jafari in 2006, has been modified for sol...
In recent years nonlinear problems have several methods to be solved and utilize a well-known analyt...
Parabolic interface problems have many applications in physics and biology, such as hyperthermia tre...
[EN] Thesemilocal and local convergence analyses of a two-step iterative method for nonlinear nondif...
We consider the global error bound for the generalized nonlinear complementarity problem over a poly...
A novel family of numerical integration of closed Newton-Cotes quadrature rules is presented which u...