Results 221 to 230 of about 678,745 (265)

A Direct Search Method for Nonlinear Programming

ZAMM, 1999
Summary: 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

Direct search methods

1987
In this chapter we shall describe a number of direct search methods for minimization. Such methods do not require the explicit evaluation of any partial derivatives of the function being minimized, but instead rely solely on values of the function found during the iterative process.
openaire   +1 more source

Direct Searches: Interferometric Methods

1999
After giving a brief introduction to optical and infrared interferometry, its observables and theoretical capabilities, we focus on the specific problem of imaging faint point-like companions close to very bright sources with large interferometric arrays.
openaire   +1 more source

Rejoinder: Direct Search Method for Finding Negative Cycles

Management Science, 1972
We would like first to stress that we have not “claimed” wide applicability for this method except for the results that we have given. Our motivation for carrying out this work was to find a method of locating and tracing negative cycles to use as a subroutine in Klein's [Klein, M. 1967.
M. Florian, P. Robert
openaire   +1 more source

Optimization without derivatives: A simple direct search method

Pollack Periodica, 2007
An efficient and rapid heuristic local search method is dealt with, which can be applied for a wide class of nonlinear functions. The algorithm does not use gradients of the objective, and can be implemented in a very simple way. As it is demonstrated, its computational requirements are also low.
Csallner, András, Balogh, János
openaire   +2 more sources

Direct search methods for the molecular conformation problem

Journal of Computational Chemistry, 1994
AbstractAn important area of research in computational biochemistry is the design of molecules for specific applications. The design of these molecules, which depends on the accurate determination of their three‐dimensional structure, can be formulated as a global optimization problem.
J. C. Meza, M. L. Martinez
openaire   +1 more source

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

Electrical impedance tomography based on direct search method

Journal of Shanghai University (English Edition), 2005
Solution to impedance distribution in electrical impedance tomography (EIT) is an ill-posed nonlinear inverse problem. It is especially difficult to reconstruct an EIT image in the center area of a measured object. Tikhonov regularization with some prior information is a sound regularization method for static electrical impedance tomography under the ...
Chang Cai, Zhuang-zhi Yan
openaire   +1 more source

Direct search methods

2022
J J McKeown, D Meegan, D Sprevak
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