Results 1 to 10 of about 4,101,603 (190)
Dai-Kou type conjugate gradient methods with a line search only using gradient [PDF]
Journal of Inequalities and Applications, 2017 In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope.
Yuanyuan Huang, Changhe Liu
doaj +2 more sources
A brief survey of line search methods for optimization problems
Results in Control and OptimizationThe line search methods for optimization problems have garnered widespread adoption across various domains and applications, primarily due to their effectiveness in addressing intricate problems. An important component that ensures the success of various
Audu Umar Omesa +5 more
doaj +3 more sources
Search on a Line by Byzantine Robots [PDF]
International Journal of Foundations of Computer Science, 2021 We consider the problem of fault-tolerant parallel search on an infinite line by [Formula: see text] robots. Starting from the origin, the robots are required to find a target at an unknown location. The robots can move with maximum speed [Formula: see text] and can communicate wirelessly among themselves. However, among the [Formula: see text] robots,
Jurek Czyzowicz +6 more
openaire +5 more sources
A modified Liu-Storey scheme for nonlinear systems with an application to image recovery [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2023 Like the Polak-Ribi`ere-Polyak (PRP) and Hestenes-Stiefel (HS) meth-ods, the classical Liu-Storey (LS) conjugate gradient scheme is widely be-lieved to perform well numerically.
A.I. Kiri, M.Y. Waziri, K. Ahmed
doaj +1 more source
Journal of Numerical Analysis and Approximation Theory, 2020 This paper presents a comparative numerical study between line search methods and majorant functions to compute the displacement step in barrier logarithmic method for linear programming.
Soraya Chaghoub, Djamel Benterki
doaj +7 more sources
Logarithmic Barrier Method Via Minorant Function for Linear Semidefinite Programming
Annales Mathematicae Silesianae, 2023 We propose in this study, a new logarithmic barrier approach to solve linear semidefinite programming problem. We are interested in computation of the direction by Newton’s method and of the displacement step using minorant functions instead of line ...
Leulmi Assma
doaj +1 more source
An adaptive descent extension of the Polak–Rebière–Polyak conjugate gradient method based on the concept of maximum magnification [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2021 Recently, a one-parameter extension of the Polak–Rebière–Polyak method has been suggested, having acceptable theoretical features and promising numerical behavior.
Z. Aminifard, S. Babaie-Kafaki
doaj +1 more source
Mathematics, 2022 In this paper, a hybrid gradient simulated annealing algorithm is guided to solve the constrained optimization problem. In trying to solve constrained optimization problems using deterministic, stochastic optimization methods or hybridization between ...
Khalid Abdulaziz Alnowibet +4 more
doaj +1 more source
A New hybrid generalized CG- method for non-linear functions [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 In this paper a new extended generalized conjugate gradient algorithm is proposed for unconstrained optimization, which is considered as anew inverse hyperbolic model .In order to improve the rate of convergence of the new technique, a new hybrid ...
Abbas Al-Bayati, Hamsa Chilmerane
doaj +1 more source
An Accelerated Convex Optimization Algorithm with Line Search and Applications in Machine Learning
Mathematics, 2022 In this paper, we introduce a new line search technique, then employ it to construct a novel accelerated forward–backward algorithm for solving convex minimization problems of the form of the summation of two convex functions in which one of these ...
Dawan Chumpungam +2 more
doaj +1 more source