Multidimensional bisection applied to global optimisation

DOI10.1016/0898-1221(91)90170-9zbMath0735.65041OpenAlexW1988654837MaRDI QIDQ1174537

Graham R. Wood

Publication date: 25 June 1992

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90170-9

zbMATH Keywords

global optimizationconvergencereductiondeterministic algorithmsLipschitz continuous functionseliminationbracketacceleration techniquesmultidimensional bisection

Mathematics Subject Classification ID

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

Related Items (17)

Customizing methods for global optimization -- a geometric viewpoint ⋮ New LP bound in multivariate Lipschitz optimization: Theory and applications ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ Towards pure adaptive search ⋮ An algorithm for maximizing a convex function over a simple set ⋮ Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. ⋮ Global root bracketing method with adaptive mesh refinement ⋮ Convergence rates of a global optimization algorithm ⋮ The bisection method in higher dimensions ⋮ Multidimensional bisection: the performance and the context ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ On the convergence of a population-based global optimization algorithm ⋮ Optimal bundle composition in competition for continuous attributes ⋮ Global optimization requires global information ⋮ Solving the sum-of-ratios problem by a stochastic search algorithm ⋮ Accelerations for a variety of global optimization methods ⋮ Multidimensional bisection: A dual viewpoint

Cites Work

• On the convergence of global methods in multiextremal optimization
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• 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
• A Sequential Method Seeking the Global Maximum of a Function
• Unnamed Item

This page was built for publication: Multidimensional bisection applied to global optimisation