The bisection method in higher dimensions
From MaRDI portal
Publication:1198735
DOI10.1007/BF01581205zbMath0813.90110OpenAlexW2090950708MaRDI QIDQ1198735
Publication date: 16 January 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581205
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Customizing methods for global optimization -- a geometric viewpoint, New LP bound in multivariate Lipschitz optimization: Theory and applications, Towards pure adaptive search, A global convergent derivative-free method for solving a system of non-linear equations, Unnamed Item, A triple \((S, s, \ell)\)-thresholds base-stock policy subject to uncertainty environment, returns and order cancellations, Random number generators in genetic algorithms for unconstrained and constrained optimization, Topics in Lipschitz global optimisation, Multidimensional bisection applied to global optimisation, A new trigonometrical algorithm for computing real root of non-linear transcendental equations, Multidimensional bisection: the performance and the context, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms, Optimal bundle composition in competition for continuous attributes, Abstract convexity:examples and applications, Lipschitz programming via increasing convex-along-rays functions*, Cutting angle methods in global optimization, Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints, Accelerations for a variety of global optimization methods, Multidimensional bisection: A dual viewpoint
Cites Work
- Unnamed Item
- On computing the dispersion function
- Multidimensional bisection applied to global optimisation
- A bisection method for systems of nonlinear equations
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Iterative Methods for the Localization of the Global Maximum
- Space tiling zonotopes
- An algorithm for finding the absolute extremum of a function
- A Sequential Method Seeking the Global Maximum of a Function