Results 211 to 220 of about 678,745 (265)

Direct Search Optimization Method

Journal of the Structural Division, 1973
A 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

Bilevel Nash Equilibrium Problems: Numerical Approximation Via Direct-Search Methods

Dynamic Games and Applications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesco Caruso   +2 more
openaire   +2 more sources

Direct search methods for nonsmooth optimization

2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601), 2004
We 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.
D. Popovic, A.R. Teel
openaire   +1 more source

A New Direct Search Optimization Method

Journal of Information and Optimization Sciences, 1988
Abstract A new direct search nonlinear optimization algorithm is presented. The new algorithm utilizes a specially developed automatic step adjustment algorithm to be used in conjunction with pattern search method developed by Hooke and Jeeves. Two automatic step adjustment schemes arc described. The new algorithm was tested using standard optimization
Samir S. Raouf, Najat M. Rashid
openaire   +1 more source

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   +2 more sources

Single-tree method for grammar-directed search

1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), 1999
We 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 ...
L. Nguyen, R. Schwartz
openaire   +1 more source

Home - About - Disclaimer - Privacy