line search


Also found in: Encyclopedia, Wikipedia.

line search

Reconnaissance along a specific line of communications, such as a road, railway or waterway, to detect fleeting targets and activities in general.
Dictionary of Military and Associated Terms. US Department of Defense 2005.
References in periodicals archive ?
The Super Puma traced a creeping line search pattern and, after flying over the area for a little more than an hour, the infrared camera operator spotted a shape floating in the sea.
They, however, limited their search to a two-kilometre radius based on line search and open search methods.
He said that most area of the lake has been searched out and the team is continuing line search, open and diving search to recover missing persons.
A line search for minimizing RMS[E.sub.A] is carried out over [R.sub.s], whose present value is used to update [R.sub.sh] by solving (8), which is a modified version of (4) that takes into account deviation between nominal and empirical maximum power:
In a line search, searchers divide the area to be searched into strips.
BFGS method does not require exact line search in order to converge, therefore, Wolfe line search algorithm (Wolfe, 1969; 1971) is acquired to fnd step length a The strong Wolfe line search algorithm requires the following conditions to be satisfed.
"Officers attended and a full line search was conducted with support from Cheshire Police.
In this paper, 2D Fourier domain line search MUSIC (FDLSM) is introduced to jointly estimate elevation and azimuth information for massive MIMO systems.
In (2), [[alpha].sub.k] > 0 is a general line search and [d.sub.k] is a search direction given by
By clicking the Thesaurus link in the upper-right corner of the search box in Advanced or Command Line search, you can view the files that have hierarchical thesauri and drill down to find specific terms that match your research topic.
where [x.sub.k] is the current iteration point and [[alpha].sub.k] > 0 is the step size obtained by some line search. The search direction [d.sub.k] is defined by
where [[alpha].sub.k] > 0 is step length which is obtained by carrying out some linear search, such as exact or inexact line search. In practical computation, exact line search is consumption time and the workload is very large, so we usually take the following inexact line search (see [5-7]).