Pages that link to "Item:Q1904648"

The following pages link to On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648):

Displaying 21 items.

• MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
• The extrapolated interval global optimization algorithm (Q540704) (← links)
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
• On the properties of Sard kernels and multiple error estimates for bounded linear functionals of bivariate functions with application to non-product cubature (Q695294) (← links)
• Experiments with range computations using extrapolation (Q858163) (← links)
• Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
• Efficient interval partitioning for constrained global optimization (Q956597) (← links)
• An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions (Q980524) (← links)
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
• Heuristic rejection in interval global optimization (Q1407232) (← links)
• Experiments with new stochastic global optimization search techniques (Q1571032) (← links)
• Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization (Q1595195) (← links)
• Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← links)
• Parallel methods for verified global optimization practice and theory (Q1817314) (← links)
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
• On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108) (← links)
• Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
• On the Asaithambi-Zuhe-Moore algorithm for computing the range of values (Q2460918) (← links)
• New interval methods for constrained global optimization (Q2490338) (← links)
• New results on verified global optimization (Q2564991) (← links)
• Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints (Q2664250) (← links)