Pages that link to "Item:Q1904648"
From MaRDI portal
The following pages link to On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648):
Displaying 39 items.
- MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
- The extrapolated interval global optimization algorithm (Q540704) (← links)
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← 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)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← 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)
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007) (← 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)
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
- The convergence speed of interval methods for global optimization (Q1361290) (← links)
- Heuristic rejection in interval global optimization (Q1407232) (← links)
- Experiments with new stochastic global optimization search techniques (Q1571032) (← links)
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests (Q1580430) (← 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)
- The impact of accelerating tools on the interval subdivision algorithm for global optimization (Q1804056) (← links)
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization (Q1810785) (← 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)
- Generalized subinterval selection criteria for interval global optimization (Q2387747) (← links)
- On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108) (← links)
- On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← 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)
- A Hybrid Subdivision Strategy for Result-Verifying Nonlinear Solvers (Q2954926) (← links)
- Subdivision Direction Selection in Interval Methods for Global Optimization (Q4340792) (← links)
- A new hybrid genetic algorithm for global optimization (Q4378896) (← links)
- Interval QFT: a mathematical and computational enhancement of QFT (Q4543686) (← links)
- Interval Methods for Global Optimization Using the Boxing Method (Q4577116) (← links)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
- Lipschitz continuity and the termination of interval methods for global optimization (Q5948880) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
