Multidimensional bisection: the performance and the context
From MaRDI portal
Publication:686996
DOI10.1007/BF01096775zbMath0786.90062OpenAlexW2015240108MaRDI QIDQ686996
W. P. Baritompa, Baoping Zhang, Graham R. Wood
Publication date: 13 October 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01096775
branch and boundcoversLipschitz continuous functionslocalisationsdeepest point algorithmmultidimensional bisection algorithms
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items
Customizing methods for global optimization -- a geometric viewpoint, New LP bound in multivariate Lipschitz optimization: Theory and applications, An algorithm for solving global optimization problems with nonlinear constraints, Global search perspectives for multiobjective optimization, A triple \((S, s, \ell)\)-thresholds base-stock policy subject to uncertainty environment, returns and order cancellations, Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization., Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem, Optimal bundle composition in competition for continuous attributes, Lipschitz programming via increasing convex-along-rays functions*, Multidimensional bisection: A dual viewpoint
Cites Work
- Unnamed Item
- On the convergence of global methods in multiextremal optimization
- Multidimensional bisection applied to global optimisation
- Convergence rates of a global optimization algorithm
- The bisection method in higher dimensions
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Iterative Methods for the Localization of the Global Maximum
- An algorithm for finding the absolute extremum of a function
- A Sequential Method Seeking the Global Maximum of a Function
