Results 1 to 10 of about 209 (65)
Order of Convergence and Dynamics of Newton–Gauss-Type Methods
On the basis of the new iterative technique designed by Zhongli Liu in 2016 with convergence orders of three and five, an extension to order six can be found in this paper. The study of high-convergence-order iterative methods under weak conditions is of
Ramya Sadananda +3 more
doaj +1 more source
A Combined Conjugate Gradient Quasi-Newton Method with Modification BFGS Formula
The conjugate gradient and Quasi-Newton methods have advantages and drawbacks, as although quasi-Newton algorithm has more rapid convergence than conjugate gradient, they require more storage compared to conjugate gradient algorithms.
Mardeen Sh. Taher, Salah G. Shareef
doaj +1 more source
In recent years, some Newton-type schemes with noninteger derivatives have been proposed for solving nonlinear transcendental equations by using fractional derivatives (Caputo and Riemann–Liouville) and conformable derivatives.
Giro Candelario +3 more
doaj +1 more source
Newton-Type Methods for Solution of the Electric Network Equations
Electric newtork equations give rise to interesting mathematical models that must be faced with efficient numerical optimization techniques. Here, the classical power flow problem represented by a nonlinear system of equations is solved by inexact Newton
L.V. BARBOSA +2 more
doaj +1 more source
On the Convergence Rate of Quasi-Newton Methods on Strongly Convex Functions with Lipschitz Gradient
The main results of the study of the convergence rate of quasi-Newton minimization methods were obtained under the assumption that the method operates in the region of the extremum of the function, where there is a stable quadratic representation of the ...
Vladimir Krutikov +3 more
doaj +1 more source
Reducing Chaos and Bifurcations in Newton-Type Methods
We study the dynamics of some Newton-type iterative methods when they are applied of polynomials degrees two and three. The methods are free of high-order derivatives which are the main limitation of the classical high-order iterative schemes.
S. Amat, S. Busquier, Á. A. Magreñán
doaj +1 more source
A Family of Newton Type Iterative Methods for Solving Nonlinear Equations
In this paper, a general family of n-point Newton type iterative methods for solving nonlinear equations is constructed by using direct Hermite interpolation.
Xiaofeng Wang +4 more
doaj +1 more source
Some approximate Gauss–Newton-type methods for nonlinear ill-posed problems; pp. 227–237 [PDF]
This paper treats numerical methods for solving the nonlinear ill-posed equation F(x) = 0, where the operator F is a Fréchet differentiable operator from one Hilbert space into another Hilbert space.
Inga Kangro, Raul Kangro, Otu Vaarmann
doaj +1 more source
In the recent literature, some fractional one-point Newton-type methods have been proposed in order to find roots of nonlinear equations using fractional derivatives.
Giro Candelario +2 more
doaj +1 more source
A New Globally Convergent Self-Scaling Vm Algorithm for Convex and Nonconvex Optimization [PDF]
In unconstrained optimization, the original quasi-Newton condition where is the difference of the gradients at two successive iterations. Li and Fukushima proposed a modified BFGS methods based on a new Quasi –Newton equation where , where is a
Abbas Y. AL-Bayati, Basim A. Hassan
doaj +1 more source

