Results 1 to 10 of about 7,604,005 (288)
Dai-Kou type conjugate gradient methods with a line search only using gradient [PDF]
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
The 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
Line Search for Convex Minimization
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 +3 more sources
Line search for generalized alternating projections [PDF]
This paper is about line search for the generalized alternating projections (GAP) method. This method is a generalization of the von Neumann alternating projections method, where instead of performing alternating projections, relaxed projections are alternated. The method can be interpreted as an averaged iteration of a nonexpansive mapping. Therefore,
Mattias Fält, Pontus Giselsson
openaire +3 more sources
Other title: Dealer on-line registration system
Rev. 10/99.; Cover title.; "Dealer On-Line Procedure Manual"--Introd.; Accompanied by 1 sheet of automobile registration cards and 1 application for duplicate certificate of title, with cover ...
Connecticut. Department of Motor Vehicles. Dealers and Repairers Division.
core +10 more sources
Search on a Line by Byzantine Robots [PDF]
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 +7 more sources
A modified Liu-Storey scheme for nonlinear systems with an application to image recovery [PDF]
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
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
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]
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

