Multidimensional bisection applied to global optimisation
The paper may be viewed as a continuation of another paper of the author [The bisection method in higher dimensions (to appear)]. Relevant results from that paper are adapted and applied to the global optimization problem for Lipschitz continuous functions in many variables; consequently, a family of deterministic algorithms is established. Every member of the family begins with bracketing all global optima over a compact subset \(K\) in \(R^ n\) in a simplex, and, at each iteration, strips away regions from this initial simplex by using two processes, reduction and elimination, in such a way that at the end of an iteration the current bracket is a union of all its predecessors. Under certain conditions, this decreasing sequence of brackets will converge to the set of global optima of the function over the compact set. In addition to convergence and optimality questions, acceleration techniques are also considered.
- A Sequential Method Seeking the Global Maximum of a Function
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- scientific article; zbMATH DE number 3395303 (Why is no real title available?)
- Iterative Methods for the Localization of the Global Maximum
- On the convergence of global methods in multiextremal optimization
- The bisection method in higher dimensions
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Convergence rates of a global optimization algorithm
- The bisection method in higher dimensions
- Global optimization requires global information
- Accelerations for a variety of global optimization methods
- Multidimensional bisection: A dual viewpoint
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- On the convergence of a population-based global optimization algorithm
- A deterministic algorithm for global optimization
- New LP bound in multivariate Lipschitz optimization: Theory and applications
- Towards pure adaptive search
- An algorithm for maximizing a convex function over a simple set
- Optimal bundle composition in competition for continuous attributes
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Customizing methods for global optimization -- a geometric viewpoint
- Two-level schemes for global and multicriterion search
- Globally convergent methods for n-dimensional multiextremal optimization
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Global root bracketing method with adaptive mesh refinement
- Multidimensional bisection: the performance and the context
This page was built for publication: Multidimensional bisection applied to global optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174537)
