منابع مشابه
Parallel Direct Search Methods for Simulation-based Optimization
In many engineering disciplines, the use of realistic computing models has become an invaluable tool in the design process. Complex simulation codes are able to approximate the behavior of intricate systems or the properties of components without the need for costly physical experimentation. Optimization algorithms can be used to automatically find the set of parameters within the design space ...
متن کاملParallel Sparse Direct Methods: A short tutorial
A shorter version of this report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific r...
متن کاملDirect Search Methods: Then and Now
We discuss direct search methods for unconstrained optimization. We give a modern perspective on this classical family of derivative-free algorithms, focusing on the development of direct search methods during their golden age from 1960 to 1971. We discuss how direct search methods are characterized by the absence of the construction of a model of the objective. We then consider a number of the...
متن کاملDirect Search Methods on Reductive Homogeneous Spaces
Direct search methods are mainly designed for use in problems with no equality constraints. However, there are many instances where the feasible set is of measure zero in the ambient space and no mesh point lies within it. There are methods for working with feasible sets that are (Riemannian) manifolds, but not all manifolds are created equal. In particular, reductive homogeneous spaces seem to...
متن کاملDirect Search Methods over Lipschitz Manifolds∗
We extend direct search methods to optimization problems that include equality constraints given by Lipschitz functions. The equality constraints are assumed to implicitly define a Lipschitz manifold. Numerically implementing the inverse (implicit) function theorem allows us to define a new problem on the tangent spaces of the manifold. We can then use a direct search method on the tangent spac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics
سال: 2010
ISSN: 2311-7990
DOI: 10.33899/csmj.2010.163909