Interval subdivision strategies for constrained optimization

MaRDI QIDQ3371334zbMATHFDO

Authors

Publication date 21 February 2006

zbMATH Keywords

numerical examplesconstrained optimizationinterval analysissubdivision direction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Subdivision Direction Selection in Interval Methods for Global Optimization
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Efficient interval partitioning for constrained global optimization
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms

Cited in

(6)

• Efficient interval partitioning for constrained global optimization
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
• scientific article; zbMATH DE number 6183018 (Why is no real title available?)
• A new subdivision strategy for range computations
• The impact of accelerating tools on the interval subdivision algorithm for global optimization
• Subdivision Direction Selection in Interval Methods for Global Optimization

This page was built for publication: Interval subdivision strategies for constrained optimization

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