Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results

DOI10.1023/A:1008354711345zbMATH Open0997.90104MaRDI QIDQ1583690FDOQ1583690

Authors: András Erik Csallner, Tibor Csendes, Mihály Csaba Markót 

Publication date: 7 November 2002

Published in: Journal of Global Optimization (Search for Journal in Brave)

Recommendations

• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• Interval Methods for Global Optimization Using the Boxing Method
• Optimal multisections in interval branch-and-bound methods of global optimization
• New interval methods for constrained global optimization
• New results on verified global optimization

zbMATH Keywords

global optimizationinterval arithmeticbranch-and-bound

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Cited In (31)

• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
• Combining interval branch and bound and stochastic search
• Numerical solution for bounding feasible point sets
• A new multi-section based technique for constrained optimization problems with interval-valued objective function
• Title not available (Why is that?)
• On constrained optimization by interval arithmetic and interval order relations
• Theoretical justification of a heuristic subbox selection criterion for interval global optimization
• An efficient interval computing technique for bound-constrained uncertain optimization problems
• Interval oriented multi-section techniques for global optimization
• An interval branch and bound algorithm for global optimization of a multiperiod pricing model
• A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
• A surprising approach in interval global optimization
• Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems
• The big cube small cube solution method for multidimensional facility location problems
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• A new solution of a global optimization problem of \(C^2\)-class by branch and bound method
• A new inclusion function for optimization: kite -- the one-dimensional case
• Use of an interval global optimization tool for exploring feasibility of batch extractive distillation
• Multilevel subdivision techniques for scalar optimization problems
• A new pruning test for finding all global minimizers of nonsmooth functions
• The cluster problem in multivariate global optimization
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
• Subdomain separability in global optimization
• On interval branch-and-bound for additively separable functions with common variables
• A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
• Optimal multisections in interval branch-and-bound methods of global optimization
• Title not available (Why is that?)
• A multidimensional branch-and-prune method for interval global optimization
• (Global) optimization: historical notes and recent developments
• Theoretical rate of convergence for interval inclusion functions
• New interval methods for constrained global optimization

Uses Software

• C-XSC 2.0
• INTOPT_90

This page was built for publication: Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583690)