Results 261 to 270 of about 1,348,172 (305)
Some of the next articles are maybe not open access.
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
The directed search method for multi-objective memetic algorithms
Computational Optimization and Applications, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oliver Schütze 0001 +5 more
openaire +2 more sources
A Direct Search Method to Locate Negative Cycles in a Graph
Management Science, 1971A direct search method for locating and tracing negative cycles in a graph is developed based on a property of real, finite sequences. The efficiency of the method and its application for computing minimum cost flows is tested by applying it to solve a series of assignment problems.
M. Florian, P. Robert
openaire +1 more source
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
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 search methods for the molecular conformation problem
Journal of Computational Chemistry, 1994AbstractAn 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
Direct Searches: Interferometric Methods
1999After 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
A direct-search method for the computer design of holograms
Optics Communications, 1996A direct-search method for the computer design of phase holograms is presented. This general method is based upon making a succession of small changes to the hologram phase distribution under the control of a cost function. It is not restricted to any particular optical geometry.
Matthew Clark, Robin Smith
openaire +1 more source
A directed search method for test generation using a concurrent simulator
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989A description is given of the application of a concurrent fault simulator to automatic test vector generation. As faults are simulated in the fault simulator a cost function is simultaneously computed. A simple cost function is the distance (in terms of the number of gates and flip-flops) of a fault effect from a primary output.
Vishwani D. Agrawal +2 more
openaire +2 more sources
Synthesis of antireflection coatings by the direct search method
Soviet Journal of Quantum Electronics, 1978The direct search method is proposed as the optimization technique for the design of antireflection coatings without calculation of the derivatives of the objective function. The synthesis procedure is described. Certain specific problems on the antireflection coating of various materials are solved by this method.
G Ya Kolodnyĭ +3 more
openaire +1 more source
Comparison of Some Penalty and Barrier Techniques in Direct Search Methods
2014 14th International Conference on Computational Science and Its Applications, 2014Constrained nonlinear optimization problems are very common in real live situations and in several areas of knowledge. To handle the constrains in these problems Penalty and barrier techniques are widely used. In penalty or barrier methods a sequence of unconstrained problems is constructed and then they are solved using unconstrained optimization ...
Aldina Correia +3 more
openaire +1 more source