Results 271 to 280 of about 1,348,172 (305)

A new method of integer linear programming—Branch direction search method

Applied Mathematics and Mechanics, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Direct search methods

2022
J J McKeown, D Meegan, D Sprevak
openaire   +1 more source

A comparison of a direct search method and a genetic algorithm for conformational searching

Journal of Computational Chemistry, 1996
We 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, Richard S. Judson, T. R. Faulkner, Adi M. Treasurywala   +3 more
openaire   +1 more source

Some Applications of Direct Search Methods

1999
In recent years, direct search methods DSM) have been used to investigate the stability and accuracy of various numerical algorithms. This approach often provides an additional information about algorithm performance, which may be difficult to discover using theoretical analysis or direct numerical tests.
Singer, Saša, Singer, Sanja
openaire   +1 more source

A Survey on Direct Search Methods for Blackbox Optimization and Their Applications

2014
Blackbox optimization typically arises when the functions defining the objective and constraints of an optimization problem are computed through a computer simulation. The blackbox is expensive to compute, can have limited precision and can be contaminated with numerical noise.
openaire   +1 more source

A direct search method for unconstrained quantile-based simulation optimization

European Journal of Operational Research, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A direct search quasi-Newton method for nonsmooth unconstrained optimization

ANZIAM Journal, 2017
A direct search quasi-Newton algorithm is presented for local minimization of Lipschitz continuous black-box functions. The method estimates the gradient via central differences using a maximal frame around each iterate. When nonsmoothness prevents progress, a global direction search is used to locate a descent direction.
openaire   +1 more source

Direct search optimization method

Computer-Aided Design, 1974
openaire   +1 more source

Chapter 7: Direct Search Methods

2022
openaire   +1 more source

Schedule optimization by the methods of directed search

Cybernetics, 1973
D. I. Golenko, Yu. Ya. Tarnopol'skii
openaire   +1 more source