Customizing methods for global optimization -- a geometric viewpoint
From MaRDI portal
Publication:2366969
Recommendations
Cites work
- A deterministic algorithm for global optimization
- 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
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- Multidimensional bisection applied to global optimisation
- Multidimensional bisection: the performance and the context
- The bisection method in higher dimensions
Cited in
(10)- An application of Lipschitzian global optimization to product design
- Accelerations for a variety of global optimization methods
- Accelerations for global optimization covering methods using second derivatives
- Multidimensional bisection: A dual viewpoint
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- On parallel branch and bound frameworks for global optimization
- Towards pure adaptive search
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- On a global optimization algorithm for bivariate smooth functions
- On an asymptotic property of a simplicial statistical model of global optimization
This page was built for publication: Customizing methods for global optimization -- a geometric viewpoint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366969)