Results 31 to 40 of about 264,051 (290)

On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization [PDF]

open access: yesSIAM Journal on Optimization, 2002
This paper establishes a general convergence theory for unconstrained optimization without derivatives. The authors present new globally convergent algorithms which combine pattern and line search approaches.
LUCIDI, Stefano, M. SCIANDRONE
openaire   +5 more sources

A method with inertial extrapolation step for convex constrained monotone equations

open access: yesJournal of Inequalities and Applications, 2021
In recent times, various algorithms have been incorporated with the inertial extrapolation step to speed up the convergence of the sequence generated by these algorithms.
Abdulkarim Hassan Ibrahim   +3 more
doaj   +1 more source

Re-modified derivative-free iterative method for nonlinear monotone equations with convex constraints

open access: yesAin Shams Engineering Journal, 2021
In this note, we propose a modification as an alternative to remove the assumption of uniformly monotone as assumed in Aliyu et al. (2019). Numerical experiment shows that the modification improves the numerical performance of the method.
Abdulkarim Hassan Ibrahim, Poom Kumam
doaj   +1 more source

Local convergence for composite Chebyshev-type methods

open access: yesCommunications in Advanced Mathematical Sciences, 2018
We replace Chebyshev's method for solving equations requiring the second derivative by a Chebyshev-type second derivative free method. The local convergence analysis of the new method is provided using hypotheses only on the first derivative in contrast ...
Santhosh George, İoannis K Argyros
doaj   +1 more source

Efficient Derivative-Free Class of Seventh Order Method for Non-differentiable Equations

open access: yesEuropean Journal of Mathematical Analysis, 2023
Many applications from a wide variety of disciplines in the natural sciences and also in engineering are reduced to solving of an equation or a system of equations in a correspondingly chosen abstract area.
oannis K. Argyros   +3 more
doaj   +1 more source

An Algorithm Derivative-Free to Improve the Steffensen-Type Methods

open access: yesSymmetry, 2021
Solving equations of the form H(x)=0 is one of the most faced problem in mathematics and in other science fields such as chemistry or physics. This kind of equations cannot be solved without the use of iterative methods. The Steffensen-type methods, defined using divided differences are derivative free, are usually considered to solve these problems ...
Miguel Ángel Hernández-Verón   +4 more
openaire   +4 more sources

A derivative-free root-finding algorithm using exponential method and its implementation

open access: yesBMC Research Notes, 2023
Objective In this paper, we develop a new root-finding algorithm to solve the given non-linear equations. The proposed root-finding algorithm is based on the exponential method. This algorithm is derivative-free and converges fast.
Srinivasarao Thota   +3 more
doaj   +1 more source

Hybridization of Multi-Objective Deterministic Particle Swarm with Derivative-Free Local Searches

open access: yesMathematics, 2020
The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems.
Riccardo Pellegrini   +5 more
doaj   +1 more source

Efficient Fourth-Order Scheme for Multiple Zeros: Applications and Convergence Analysis in Real-Life and Academic Problems

open access: yesMathematics, 2023
High-order iterative techniques without derivatives for multiple roots have wide-ranging applications in the following: optimization tasks, where the objective function lacks explicit derivatives or is computationally expensive to evaluate; engineering ...
Sunil Kumar   +2 more
doaj   +1 more source

StepDIRECT - A Derivative-Free Optimization Method for Stepwise Functions

open access: yes, 2022
In this paper, we propose the StepDIRECT algorithm for derivative-free optimization (DFO), in which the black-box objective function has a stepwise landscape. Our framework is based on the well-known DIRECT algorithm. By incorporating the local variability to explore the flatness, we provide a new criterion to select the potentially optimal hyper ...
Dzung T. Phan   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy