Pure random search with virtual extension of feasible region
type: Item
instance of: scholarly article
title: Pure random search with virtual extension of feasible region
zbMATH Open document ID: 1505.65220
author: E. A. Tsvetkov
author: R. A. Krymov
published in: Journal of Optimization Theory and Applications
publication date: 2022-11-07T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 7612886
zbMATH Keywords: pure random search
zbMATH Keywords: stochastic optimisation
zbMATH Keywords: sample size estimation
zbMATH Keywords: boundary points
MaRDI profile type: Publication
full work available at URL: s10957-022-02097-w
OpenAlex ID: W4296184734
cites work: The DIRECT algorithm: 25 years later
cites work: An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
cites work: Improvement of pure random search in global optimization
cites work: Why does Monte Carlo fail to work properly in high-dimensional optimization problems?
cites work: Q4788633
cites work: Minimization by Random Search Techniques
cites work: Introduction to Stochastic Search and Optimization
cites work: Optimal strategies of the search for an extremum
cites work: Pure adaptive search in global optimization
cites work: Stochastic adaptive search for global optimization.
cites work: Stochastic global optimization.
DOI: 10.1007/S10957-022-02097-W
description: scientific article; zbMATH DE number 7612886