Results 21 to 30 of about 859,071 (262)
A New Hybrid Approach for Solving Large-scale Monotone Nonlinear Equations
Journal of Mathematical and Fundamental Sciences, 2020 In this paper, a new hybrid conjugate gradient method for solving monotone nonlinear equations is introduced. The scheme is a combination of the Fletcher-Reeves (FR) and Polak-Ribiére-Polyak (PRP) conjugate gradient methods with the Solodov and Svaiter ...
Jamilu Sabi’u +3 more
doaj +1 more source
Mathematical and Computational Applications, 2020 A number of practical problems in science and engineering can be converted into a system of nonlinear equations and therefore, it is imperative to develop efficient methods for solving such equations.
Aliyu Muhammed Awwal +4 more
doaj +1 more source
Zhongguo dianli, 2020 In order to reduce the power losses in power transmission from West to East, an optimal power distribution strategy with minimized losses is studied for the West-to-East power transmission channels based on both theoretical analysis and simulation ...
Gaihong CHENG, Qingchun ZHU, Jing YAN
doaj +1 more source
Group Search on the Line [PDF]
, 2015 In this paper we consider the group search problem, or evacu- ation problem, in which k mobile entities (\({\cal M}{\cal E}\)s) located on the line perform search for a specific destination. The \({\cal M}{\cal E}\)s are initially placed at the same origin on the line L and the target is located at an unknown distance d, either to the left or to the ...
Marek Chrobak +3 more
openaire +1 more source
Inertial-Based Derivative-Free Method for System of Monotone Nonlinear Equations and Application
IEEE Access, 2020 Iterative methods for solving nonlinear problems are of great importance due to their appearance in various areas of applications. In this paper, based on the inertial effect, we propose two projection derivative-free iterative methods for solving system
Aliyu Muhammed Awwal +4 more
doaj +1 more source
A Hybrid Line Search Technique with Modified Goldstein and Wolfe Conditions [PDF]
مجلة التربية والعلم, 2013 Modified Goldstein or Wolfe conditions can be imposed on a hybrid line search to ensure the convergence property of an iterative nonlinear optimization algorithm to a stationary point.
Sawsan S. Ismael Department of Math
doaj +1 more source
, 2001 All unconstrained and many constrained optimization problems involve line searches, i.e. minimizing the value of a certain function along a properly chosen direction. There are several methods for performing such one-dimensional optimization but all of them require that the function be unimodal along the search interval. That may force small step sizes
Sebastián Lozano 0001 +3 more
openaire +1 more source
Line Search for Convex Minimization
CoRR, 2023 Golden-section search and bisection search are the two main principled algorithms for 1d minimization of quasiconvex (unimodal) functions. The first one only uses function queries, while the second one also uses gradient queries. Other algorithms exist under much stronger assumptions, such as Newton's method.
Laurent Orseau, Marcus Hutter
openaire +2 more sources
Mathematics, 2022 In this paper, we follow a chronological development of gradient descent methods and its accelerated variants later on. We specifically emphasise some contemporary approaches within this research field. Accordingly, a constructive overview over the class
Vladimir Rakočević +1 more
doaj +1 more source
A new conjugate gradient method for acceleration of gradient descent algorithms
Moroccan Journal of Pure and Applied Analysis, 2021 An accelerated of the steepest descent method for solving unconstrained optimization problems is presented. which propose a fundamentally different conjugate gradient method, in which the well-known parameter βk is computed by an new formula.
Rahali Noureddine +2 more
doaj +1 more source