Performance of global random search algorithms for large dimensions
From MaRDI portal
(Redirected from Publication:1754447)
Recommendations
- scientific article; zbMATH DE number 4020863
- Comparison of some random search procedures for a global extremum
- scientific article; zbMATH DE number 3920191
- Randomized algorithm for global optimization with bounded memory
- scientific article; zbMATH DE number 4199988
- Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$
- Computational algorithms based on random search for solving global optimization problems
- A direct stochastic algorithm for global search
- scientific article; zbMATH DE number 970363
Cites work
- scientific article; zbMATH DE number 3980913 (Why is no real title available?)
- scientific article; zbMATH DE number 46645 (Why is no real title available?)
- scientific article; zbMATH DE number 50672 (Why is no real title available?)
- scientific article; zbMATH DE number 1199856 (Why is no real title available?)
- A statistical model-based algorithm for `black-box' multi-objective optimisation
- Branch and probability bound methods in multi-objective optimization
- Comparison of tail index estimators
- Convergence properties of stochastic optimization procedures
- Estimation of the Minimum of a Function Using Order Statistics
- Minimization by Random Search Techniques
- Optimal designs in regression with correlated errors
- Optimal linear estimation of bounds of random variables
- Records. Mathematical theory.
- Semiparametric statistical inference in global random search
- Stochastic global optimization.
- Stopping rules in \(k\)-adaptive global random search algorithms
- Theory of evolution strategies: a new perspective
Cited in
(9)- An adaptive procedure for the global minimization of a class of polynomial functions
- Global optimization using random embeddings
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization
- Multistart with early termination of descents
- Generation of \(\alpha\)-dense curves in infinite dimensional Banach spaces
- Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms
- Guest editors' preface to the special issue devoted to the 2nd international conference ``Numerical computations: theory and algorithms, June 19--25, 2016, Pizzo Calabro, Italy
- Continuous global optimization on fractals through \(\alpha\)-dense curves
- scientific article; zbMATH DE number 4020863 (Why is no real title available?)
This page was built for publication: Performance of global random search algorithms for large dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754447)
