Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
From MaRDI portal
Publication:1583690
DOI10.1023/A:1008354711345zbMath0997.90104MaRDI QIDQ1583690
Mihály Csaba Markót, Tibor Csendes, András Erik Csallner
Publication date: 7 November 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items
A new multi-section based technique for constrained optimization problems with interval-valued objective function, An efficient interval computing technique for bound-constrained uncertain optimization problems, Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems, Numerical solution for bounding feasible point sets, (Global) optimization: historical notes and recent developments, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms, Combining interval branch and bound and stochastic search, Use of an interval global optimization tool for exploring feasibility of batch extractive distillation, On constrained optimization by interval arithmetic and interval order relations, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, New interval methods for constrained global optimization, Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms, The big cube small cube solution method for multidimensional facility location problems, Interval oriented multi-section techniques for global optimization, A new pruning test for finding all global minimizers of nonsmooth functions, A new inclusion function for optimization: kite -- the one-dimensional case
Uses Software
