Heuristic rejection in interval global optimization
From MaRDI portal
Publication:1407232
DOI10.1023/A:1024731306785zbMATH Open1033.90085MaRDI QIDQ1407232FDOQ1407232
V. G. Ruíz, I. García, Tibor Csendes, L. G. Casado
Publication date: 15 September 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- PROFIL/BIAS - A fast interval library
- Rigorous global search: continuous problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Title not available (Why is that?)
- A new multisection technique 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
- An interval arithmetic method for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- New results on verified global optimization
Cited In (6)
- A new multi-section based technique for constrained optimization problems with interval-valued objective function
- On constrained optimization by interval arithmetic and interval order relations
- A heuristic rejection criterion in interval global optimization algorithms
- An efficient interval computing technique for bound-constrained uncertain optimization problems
- Interval oriented multi-section techniques for global optimization
- On estimating workload in interval branch-and-bound global optimization algorithms
Uses Software
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)