MSO: a framework for bound-constrained black-box global optimization algorithms
From MaRDI portal
Recommendations
- On the convergence of adaptive stochastic search methods for constrained and multi-objective black-box optimization
- DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
- Global optimization of expensive black box problems with a known lower bound
- Generating set search using simplex gradients for bound-constrained black-box optimization
- An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization
- An adaptive direct multisearch method for black-box multi-objective optimization
- Hierarchically constrained blackbox optimization
- scientific article; zbMATH DE number 2188971
- A CARTopt method for bound-constrained global optimization
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3718485 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3628741 (Why is no real title available?)
- scientific article; zbMATH DE number 3370185 (Why is no real title available?)
- scientific article; zbMATH DE number 3395303 (Why is no real title available?)
- scientific article; zbMATH DE number 3402053 (Why is no real title available?)
- A Sequential Method Seeking the Global Maximum of a Function
- A Survey of Some Model-Based Methods for Global Optimization
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- A deterministic approach to global box-constrained optimization
- A deterministic global optimization using smooth diagonal auxiliary functions
- A global minimization algorithm with parallel iterations
- A locally-biased form of the DIRECT algorithm.
- A modified DIRECT algorithm with bilevel partition
- A one-dimensional deterministic global minimization algorithm
- Additive scaling and the \texttt{DIRECT} algorithm
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Asymptotically efficient adaptive allocation rules
- Constructive links between some morphological hierarchies on edge-weighted graphs
- Finite-time analysis of the multiarmed bandit problem
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global multidimensional optimization on parallel computer
- Global optimization
- Global optimization by multilevel coordinate search
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Globally convergent methods for n-dimensional multiextremal optimization
- Globally-biased disimpl algorithm for expensive global optimization
- Handbook of test problems in local and global optimization
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Lipschitzian optimization without the Lipschitz constant
- Local tuning and partition strategies for diagonal GO methods
- On convergence of "divide the best" global optimization algorithms
- On the Number of Iterations of Piyavskii's Global Optimization Algorithm
- On the convergence of global methods in multiextremal optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Optimal strategies of the search for an extremum
- Outer approximation algorithm for nondifferentiable optimization problems
- Parallel global optimization of functions of several variables
- Prediction, Learning, and Games
- Simplicial global optimization
- Some aspects of the sequential design of experiments
- Subdivision Direction Selection in Interval Methods for Global Optimization
Cited in
(7)- A naive multi-scale search algorithm for global optimization problems
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization
- \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
- MSO
- Evaluation of an MSO-Solver
- 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
This page was built for publication: MSO: a framework for bound-constrained black-box global optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q524912)
