Heuristic rejection in interval global optimization

DOI10.1023/A:1024731306785MaRDI QIDQ1407232zbMATH OpenFDO

Authors V. G. Ruíz, L. G. Casado, I. García, Tibor Csendes

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)

Recommendations

• A heuristic rejection criterion in interval global optimization algorithms
• New subinterval selection criteria for interval global optimization
• Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
• Experiments with a new selection criterion in a fast interval optimization algorithm
• New interval analysis support functions using gradient information in a global minimization algorithm

Cites work

• scientific article; zbMATH DE number 54095 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• scientific article; zbMATH DE number 761488 (Why is no real title available?)
• A heuristic rejection criterion in interval global optimization algorithms
• A new multisection technique in interval methods for global optimization
• An interval arithmetic method for global optimization
• Experiments with a new selection criterion in a fast interval optimization algorithm
• New results on verified global optimization
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• PROFIL/BIAS - A fast interval library
• Rigorous global search: continuous problems
• Subdivision Direction Selection in Interval Methods for Global Optimization

Cited in

(6)

• Interval oriented multi-section techniques for global optimization
• A new multi-section based technique for constrained optimization problems with interval-valued objective function
• A heuristic rejection criterion in interval global optimization algorithms
• 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

Describes a project that uses

Uses Software

• C-XSC
• PROFIL/BIAS
• INTOPT_90

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

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