Results 251 to 260 of about 730,500 (301)
Some of the next articles are maybe not open access.
Direct search methods for nonsmooth optimization
2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601), 2004We present analytical tools that enable development of globally convergent direct search methods for minimization of nonsmooth locally Lipschitz functions. The theory is illustrated with the design of new algorithms.
Dobrivoje Popovic, Andrew R. Teel
openaire +3 more sources
Direct methods for the search of the second invariant
Physics Reports, 1987Abstract We discuss the direct methods that can be used to search for the second invariant of a system defined by the Hamiltonian H = 1 2 (p x 2 ) + p y 2 + A(x, y)p x + B(x, y)p y + V(x, y) . We give an extensive review of those systems that are known to have an invariant that is polynomial in the p 's (
Jarmo Hietarinta
openaire +3 more sources
Direct-search penalty/barrier methods
, 2010 In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Problems. There are several Penalty/Barrier Methods and they are used in several areas from Engineering to Economy, through Biology, Chemistry, Physics among others.
Correia, Aldina +3 more
openaire +3 more sources
Direct Search Optimization Method
Journal of the Structural Division, 1973A nongradient direct search procedure is presented to treat general structural optimization problems, in which the independent design variables are discrete in nature. The procedure combines the basic ideas of the complex method of Box with the pattern search of Hooke and Jeeves.
Ying-San Lai, Jan D. Achenbach
openaire +1 more source
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
SIAM Review, 2003 Direct search methods are best known as unconstrained optimization techniques that do not explicitly use derivatives. Direct search methods were formally proposed and widely applied in the 1960s but fell out of favor with the mathematical optimization ...
Tamara G Kolda +2 more
exaly +1 more source
Single-tree method for grammar-directed search
1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), 1999We present a very fast and accurate fast-match algorithm which, when followed by a regular beam search restricted within only the subset of words selected by the fast-match, can speed up the recognition process by at least two orders of magnitude in comparison to a typical single-pass speech recognizer utilizing the Viterbi (or beam) search algorithm ...
Long Nguyen 0001, Richard M. Schwartz
openaire +1 more source
A comparison of a direct search method and a genetic algorithm for conformational searching
Journal of Computational Chemistry, 1996We present results from the application of two conformational searching methods: genetic algorithms (GA) and direct search methods for finding low energy conformations of organic molecules. GAs are in a class of biologically motivated optimization methods that evolve a population of individuals in which individuals who are more “fit” have a higher ...
Juan C. Meza +3 more
openaire +1 more source
Search directions for a class of projective methods
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A Direct Search Method for Nonlinear Programming
ZAMM, 1999Summary: An iterative model algorithm for minimizing a Lipschitz-continuous function subject to continuous constraints is introduced. Each iteration of the method proceeds in two phases. In the first phase, feasibility is improved and, as a result, a more feasible intermediate point is obtained.
openaire +2 more sources