Performance of global random search algorithms for large dimensions
From MaRDI portal
Publication:1754447
DOI10.1007/S10898-017-0535-8zbMATH Open1402.90135OpenAlexW2621377871MaRDI QIDQ1754447FDOQ1754447
Authors: Andrey Pepelyshev, Antanas Žilinskas, A. Zhigljavsky 
Publication date: 30 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/100842/1/large_dimension.pdf
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
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- Comparison of tail index estimators
- Records. Mathematical theory.
- Optimal designs in regression with correlated errors
- Title not available (Why is that?)
- Convergence properties of stochastic optimization procedures
- Minimization by Random Search Techniques
- Theory of evolution strategies: a new perspective
- Title not available (Why is that?)
- Stochastic global optimization.
- A statistical model-based algorithm for `black-box' multi-objective optimisation
- Semiparametric statistical inference in global random search
- Estimation of the Minimum of a Function Using Order Statistics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stopping rules in \(k\)-adaptive global random search algorithms
- Optimal linear estimation of bounds of random variables
- Branch and probability bound methods in multi-objective optimization
Cited In (9)
- Global optimization using random embeddings
- An adaptive procedure for the global minimization of a class of polynomial functions
- \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
- Title not available (Why is that?)
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)
