Pages that link to "Item:Q1174537"
From MaRDI portal
The following pages link to Multidimensional bisection applied to global optimisation (Q1174537):
Displaying 18 items.
- Global root bracketing method with adaptive mesh refinement (Q668161) (← links)
- Multidimensional bisection: the performance and the context (Q686996) (← links)
- Solving the sum-of-ratios problem by a stochastic search algorithm (Q1024829) (← links)
- Convergence rates of a global optimization algorithm (Q1186279) (← links)
- The bisection method in higher dimensions (Q1198735) (← links)
- Global optimization requires global information (Q1264973) (← links)
- Accelerations for a variety of global optimization methods (Q1315439) (← links)
- Multidimensional bisection: A dual viewpoint (Q1324321) (← links)
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. (Q1416301) (← links)
- On the convergence of a population-based global optimization algorithm (Q1777440) (← links)
- A deterministic algorithm for global optimization (Q1803605) (← links)
- New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
- Towards pure adaptive search (Q1905968) (← links)
- An algorithm for maximizing a convex function over a simple set (Q1918984) (← links)
- Optimal bundle composition in competition for continuous attributes (Q2030370) (← links)
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints (Q2156486) (← links)
- Customizing methods for global optimization -- a geometric viewpoint (Q2366969) (← links)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
