Multisection in Interval Branch-and-Bound Methods for Global Optimization II. Numerical Tests

Authors:
Mihály Csaba Markót;Tibor Csendes;András Erik Csallner
Affiliations:
Institute of Informatics, József Attila University, Szeged, Árpád tér 2., Hungary (e-mail: markot@inf.u-szeged.hu);Department of Applied Informatics, József Attila University, Szeged, Árpád tér 2., Hungary (e-mail: csendes@inf.u-szeged.hu);Department of Computer Science, Juhász Gyula Teachers Training College, Szeged, Boldogasszony sgt. 4., Hungary (e-mail: csallner@jgytf.u-szeged.hu)
Venue:
Journal of Global Optimization
Year:
2000

Citing 6
Cited 7

A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization

ACM Transactions on Mathematical Software (TOMS)
New results on verified global optimization

Computing
Subdivision Direction Selection in Interval Methods for Global Optimization

SIAM Journal on Numerical Analysis
Pascal-XSC: Language Reference with Examples

Pascal-XSC: Language Reference with Examples
C-XSC: A C++ Class Library for Extended Scientific Computing

C-XSC: A C++ Class Library for Extended Scientific Computing
Multisection in Interval Branch-and-Bound Methods for Global Optimization – I. Theoretical Results

Journal of Global Optimization

Multisection in Interval Branch-and-Bound Methods for Global Optimization – I. Theoretical Results

Journal of Global Optimization
New Subinterval Selection Criteria for Interval Global Optimization

Journal of Global Optimization
A reliable area reduction technique for solving circle packing problems

Computing
Use of an interval global optimization tool for exploring feasibility of batch extractive distillation

Journal of Global Optimization
Evaluation Ranges of Functions using Balanced Random Interval Arithmetic

Informatica
Interval oriented multi-section techniques for global optimization

Journal of Computational and Applied Mathematics
The big cube small cube solution method for multidimensional facility location problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have investigated variants of interval branch-and-bound algorithms for global optimization where the bisection step was substituted by the subdivision of the current, actual interval into many subintervals in a single iteration step. The results are published in two papers, the first one contains the theoretical investigations on the convergence properties. An extensive numerical study indicates that multisection can substantially improve the efficiency of interval global optimization procedures, and multisection seems to be indispensable in solving hard global optimization problems in a reliable way.