Interval tools for global optimization
نویسندگان
چکیده
منابع مشابه
Tools for Simplicial Branch and Bound in Interval Global Optimization∗
Most branch and bound (B&B) algorithms for continuous global optimization work with hyper-rectangles, although some work in the 1970’s dealt with simplexes. More recently, Žilinskas et al have considered branch and bound for Lipschitz optimization, giving examples of how symmetry can be used and how algorithms can be made efficient. Here, in the spirit of that work, we consider simplex-based br...
متن کاملEfficient interval partitioning for constrained global optimization
1 Nanyang Technological University, School of Mechanical and Aerospace Engineering, Singapore, 2 New England Biolabs Inc., 240 County Road, Ipswich, MA [email protected] 3 Izmir Ekonomi Universitesi, Izmir, Turkey [email protected] 4 University of Szeged, Institute of Informatics, Szeged, Hungary [email protected] 5 Advanced Concepts Team, ESA/ESTEC, Noordwijk, The Netherlands Tam...
متن کاملNew interval methods for constrained global optimization
Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adaptive multisection rules which enable the algorithm to choose the proper multisection type depending on simple heuristic decision rules. Moreover, for the selection of the next box to be subdivided, we investigate new criteria. ...
متن کاملA Surprising Approach in Interval Global Optimization
The work advances a new class of global optimization methods, called graph subdivision methods, that are based on the simultaneous adaptive subdivision of both the function’s domain of definition and the range of values.
متن کاملInterval Analysis on Directed Acyclic Graphs for Global Optimization
A directed acyclic graph (DAG) representation of optimization problems represents each variable, each operation, and each constraint in the problem formulation by a node of the DAG, with edges representing the flow of the computation. Using bounds on ranges of intermediate results, represented as weights on the nodes and a suitable mix of forward and backward evaluation, it is possible to give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1991
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90159-2