Alternative sampling strategy for a random optimization algorithm
type: Item
instance of: scholarly article
title: Alternative sampling strategy for a random optimization algorithm
zbMATH Open document ID: 0796.90055
DOI: 10.1007/BF00939677
author: C. R. Gonçalves
author: Chang C. Y. Dorea
published in: Journal of Optimization Theory and Applications
publication date: 1994-04-27T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 557867
zbMATH Keywords: random optimization
zbMATH Keywords: expected length
zbMATH Keywords: sampling procedures
zbMATH Keywords: random search
MaRDI profile type: Publication
cites work: Expected number of steps of a random optimization method
cites work: Limiting Distribution for Random Optimization Methods
cites work: Stopping Rules for a Random Optimization Method
cites work: A stochastic method for global optimization
cites work: Stochastic global optimization methods part I: Clustering methods
cites work: Progressive global random search of continuous functions
Recommended article: Adaptive Sampling Strategies for Stochastic Optimization
Recommended article: Logic versus Approximation
Recommended article: Improved sampling strategies for ensemble-based optimization
Recommended article: Variable-sample methods for stochastic optimization
Recommended article: Greedy Sampling Using Nonlinear Optimization
Recommended article: Iteratively sampling scheme for stochastic optimization with variable number sample path
Recommended article: Q3576754
Recommended article: Q4247205
Recommended article: A novel sampling approach to combinatorial optimization under uncertainty
description: scientific article; zbMATH DE number 557867