Interval subdivision strategies for constrained optimization

zbMATH Open1088.65546MaRDI QIDQ3371334FDOQ3371334

Author name not available (Why is that?)

Publication date: 21 February 2006

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

zbMATH Keywords

numerical examplesconstrained optimizationinterval analysissubdivision direction

Mathematics Subject Classification ID

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

Cited In (6)

• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
• Subdivision Direction Selection in Interval Methods for Global Optimization
• The impact of accelerating tools on the interval subdivision algorithm for global optimization
• Efficient interval partitioning for constrained global optimization
• A new subdivision strategy for range computations
• Title not available (Why is that?)

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)