MSO: a framework for bound-constrained black-box global optimization algorithms
From MaRDI portal
Publication:524912
DOI10.1007/s10898-016-0441-5zbMath1394.90466OpenAlexW2404915096MaRDI QIDQ524912
Publication date: 27 April 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0441-5
samplingconvergence analysisglobal optimizationLipschitzianmulti-scaleblack-box functionsspace-partitioning
Related Items
\(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization, Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis, Pareto-aware strategies for faster convergence in multi-objective multi-scale search optimization, \textsc{Oscars}-II: an algorithm for bound constrained global optimization, A naive multi-scale search algorithm for global optimization problems, MSO
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- A modified DIRECT algorithm with bilevel partition
- Additive scaling and the \texttt{DIRECT} algorithm
- A deterministic global optimization using smooth diagonal auxiliary functions
- Asymptotically efficient adaptive allocation rules
- On the convergence of global methods in multiextremal optimization
- Global multidimensional optimization on parallel computer
- Handbook of test problems in local and global optimization
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Local tuning and partition strategies for diagonal GO methods
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Outer approximation algorithm for nondifferentiable optimization problems
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A one-dimensional deterministic global minimization algorithm
- A deterministic approach to global box-constrained optimization
- Globally-biased disimpl algorithm for expensive global optimization
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- Simplicial Global Optimization
- A global minimization algorithm with parallel iterations
- Globally convergent methods for n-dimensional multiextremal optimization
- An algorithm for finding the global maximum of a multimodal, multivariate function
- On the Number of Iterations of Piyavskii's Global Optimization Algorithm
- Subdivision Direction Selection in Interval Methods for Global Optimization
- A Survey of Some Model-Based Methods for Global Optimization
- Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
- On convergence of "divide the best" global optimization algorithms
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
- Prediction, Learning, and Games
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- Optimal strategies of the search for an extremum
- Some aspects of the sequential design of experiments
- Global optimization
- A locally-biased form of the DIRECT algorithm.
- Finite-time analysis of the multiarmed bandit problem
