Heuristic rejection in interval global optimization

DOI10.1023/A:1024731306785zbMath1033.90085MaRDI QIDQ1407232

V. G. Ruíz, Inmaculada F. García, Tibor Csendes, Leocadio G. Casado

Publication date: 15 September 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

global optimizationbranch-and-bound algorithmsInterval method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (5)

A new multi-section based technique for constrained optimization problems with interval-valued objective function ⋮ On estimating workload in interval branch-and-bound global optimization algorithms ⋮ An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ On constrained optimization by interval arithmetic and interval order relations ⋮ Interval oriented multi-section techniques for global optimization

Uses Software

• C-XSC
• PROFIL/BIAS
• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interval arithmetic method for global optimization
• PROFIL/BIAS - A fast interval library
• Rigorous global search: continuous problems
• A new multisection technique in interval methods for global optimization
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• New results on verified global optimization
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Experiments with a new selection criterion in a fast interval optimization algorithm
• A heuristic rejection criterion in interval global optimization algorithms

This page was built for publication: Heuristic rejection in interval global optimization