Multidimensional bisection: the performance and the context

DOI10.1007/BF01096775MaRDI QIDQ686996zbMATH OpenOpenAlexFDO

Authors Baoping Zhang, W. P. Baritompa, 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

zbMATH Keywords

branch and boundcoverslocalisationsLipschitz continuous functionsdeepest point algorithmmultidimensional bisection algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Recommendations

• Multidimensional bisection applied to global optimisation
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• The bisection method in higher dimensions
• Multidimensional bisection: A dual viewpoint
• Globally convergent methods for n-dimensional multiextremal optimization

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• A Sequential Method Seeking the Global Maximum of a Function
• An algorithm for finding the absolute extremum of a function
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Convergence rates of a global optimization algorithm
• Iterative Methods for the Localization of the Global Maximum
• Multidimensional bisection applied to global optimisation
• On the convergence of global methods in multiextremal optimization
• The bisection method in higher dimensions

Cited in

(12)

• The bisection method in higher dimensions
• Optimal bundle composition in competition for continuous attributes
• Boosting performance of multidimensional tores
• Multidimensional bisection: A dual viewpoint
• A triple \((S, s, \ell)\)-thresholds base-stock policy subject to uncertainty environment, returns and order cancellations
• An algorithm for solving global optimization problems with nonlinear constraints
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• Lipschitz programming via increasing convex-along-rays functions^*
• Customizing methods for global optimization -- a geometric viewpoint
• Global search perspectives for multiobjective optimization
• New LP bound in multivariate Lipschitz optimization: Theory and applications
• Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem

This page was built for publication: Multidimensional bisection: the performance and the context

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686996)