Results 261 to 270 of about 305,961 (299)

Derivative-free method for singular systems

2019 IEEE 17th International Symposium on Intelligent Systems and Informatics (SISY), 2019
This paper presents algorithm for solving singular nonlinear system. Since the convergence rate of any method to singular solution drops down, the convergence can be accelerated by forming the bordered system. Singular vectors of the Jacobian can be used for the construction of the bordered system.
Buhmiler, Sandra, Rapajić, Sanja, Lukić, Milan, Medić, Slavica, Duraković, Nataša, Grbić, Tatjana   +5 more
openaire   +1 more source

Algorithm for forming derivative-free optimal methods

Numerical Algorithms, 2013
The Newton method is the best known method for solving a nonlinear equation \(f(x)=0\) which is given as \[ x_{n+1}=x_n-\frac{f(x_n)}{f'(x_n)}, \qquad n=0,1,2,\dots, \qquad |f'(x_n)|\neq 0. \] A scheme for constructing optimal derivative free iterative methods is the main aim of the article. The derivative in Newton's method is approximated as follows \
Sanjay Kumar Khattri, Trond Steihaug
openaire   +2 more sources

Objective-derivative-free methods for constrained optimization

Mathematical Programming, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LUCIDI, Stefano, M. Sciandrone, P. Seng
openaire   +5 more sources

A family of derivative-free methods for nonlinear equations

Revista Matemática Complutense, 2010
The authors review a few third order convergent iteration methods for solving nonlinear scalar equations and propose a new family of derivative-free third order methods. Convergence and error estimates of the proposed methods are discussed and illustrated with some numerical examples.
Wang, Haijun, Li, Subei
openaire   +1 more source

CONSTRUCTION OF DERIVATIVE-FREE ITERATIVE METHODS FROM CHEBYSHEV'S METHOD

Analysis and Applications, 2013
From some modifications of Chebyshev's method, we consider a uniparametric family of iterative methods that are more efficient than Newton's method, and we then construct two iterative methods in a similar way to the Secant method from Newton's method. These iterative methods do not use derivatives in their algorithms and one of them is more efficient ...
Ezquerro, J. A., Grau, A., Grau-Sánchez, M., Hernández, M. A.   +3 more
openaire   +1 more source

Second-derivative-free variants of Cauchy’s method

Applied Mathematics and Computation, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Derivative-Free Optimization Via Proximal Point Methods

Journal of Optimization Theory and Applications, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Warren L. Hare, Yves Lucet
openaire   +2 more sources

On a family of second-derivative-free variants of Chebyshev’s method

Applied Mathematics and Computation, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jisheng Kou, Yitian Li, Xiuhua Wang 0002
openaire   +1 more source

A derivative-free descent method in set optimization

Computational Optimization and Applications, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On second derivative-free zero finding methods

Proceedings of the 2010 American Control Conference, 2010
High order root-finding algorithms are constructed from formulas for approximating higher order logarithmic and standard derivatives. These formulas are free of derivatives of second order or higher and use only function evaluation and/or first derivatives at multiple points. Richardson extrapolation technique is applied to obtain better approximations
openaire   +1 more source