Results 11 to 20 of about 7,898,408 (287)
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
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
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
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]
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 +2 more sources
Inertial-Based Derivative-Free Method for System of Monotone Nonlinear Equations and Application
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]
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
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
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

