Results 1 to 10 of about 2,111,728 (247)
Basin attractors for derivative-free methods to find simple roots of nonlinear equations
Many methods exist for solving nonlinear equations. Several of these methods are derivative-free. One of the oldest is the secant method where the derivative is replaced by a divided difference.
Beny Neta
doaj +8 more sources
Derivative-Free Conformable Iterative Methods for Solving Nonlinear Equations
In this manuscript, we use approximations of conformable derivatives for designing iterative methods to solve nonlinear algebraic or trascendental equations.
Giro Candelario +3 more
doaj +3 more sources
Two Efficient Derivative-Free Iterative Methods for Solving Nonlinear Systems
In this work, two multi-step derivative-free iterative methods are presented for solving system of nonlinear equations. The new methods have high computational efficiency and low computational cost.
Xiaofeng Wang, Xiaodong Fan
doaj +3 more sources
A number of higher order iterative methods with derivative evaluations are developed in literature for computing multiple zeros. However, higher order methods without derivative for multiple zeros are difficult to obtain and hence such methods are rare ...
J. Sharma, Sunil Kumar, I. Argyros
semanticscholar +3 more sources
Complex dynamics of derivative-free methods for nonlinear equations
The dynamical behavior of two iterative derivative-free schemes, Steffensen and M4 methods, is studied in case of quadratic and cubic polynomials. The parameter plane is analyzed for both procedures on quadratic polynomials.
F. Chicharro +3 more
semanticscholar +3 more sources
In this paper, we present a class of new derivative-free gradient type methods for large-scale nonlinear systems of monotone equations. The methods combine the RMIL conjugate gradient method, the strategy of hyperplane projection and the derivative-free ...
Xiaowei Fang
doaj +3 more sources
Model-Based Derivative-Free Methods for Convex-Constrained Optimization [PDF]
We present a model-based derivative-free method for optimization subject to general convex constraints, which we assume are unrelaxable and accessed only through a projection operator that is cheap to evaluate.
Matthew Hough, Lindon Roberts
semanticscholar +1 more source
Derivative-free methods for mixed-integer nonsmooth constrained optimization [PDF]
In this paper, mixed-integer nonsmooth constrained optimization problems are considered, where objective/constraint functions are available only as the output of a black-box zeroth-order oracle that does not provide derivative information.
T. Giovannelli +3 more
semanticscholar +1 more source
An optimal interpolation set for model-based derivative-free optimization methods [PDF]
This paper demonstrates the optimality of an interpolation set employed in derivative-free trust-region methods. This set is optimal in the sense that it minimizes the constant of well-poisedness in a ball centred at the starting point.
Tom M. Ragonneau, Zai-Kun Zhang
semanticscholar +1 more source
Comparison of some optimal derivative-free three-point iterations
We show that the well-known Khattri et al. methods and Zheng et al. methods are identical. In passing, we propose a suitable calculation formula for Khattri et al. methods.
Thugal Zhanlav, Khuder Otgondorj
doaj +7 more sources

