Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise

DOI10.1007/S10898-023-01307-7MaRDI QIDQ6166097zbMATH OpenOpenAlexFDO

Authors Zelda B. Zabinsky, David D. Linz

Publication date 2 August 2023

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.10709

zbMATH Keywords

objective function must be estimatedsampling distribution

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Abstract: Adaptive random search approaches have been shown to be effective for global optimization problems, where under certain conditions, the expected performance time increases only linearly with dimension. However, previous analyses assume that the objective function can be observed directly. We consider the case where the objective function must be estimated, often using a noisy function, as in simulation. We present a finite-time analysis of algorithm performance that combines estimation with a sampling distribution. We present a framework called Hesitant Adaptive Search with Estimation, and derive an upper bound on function evaluations that is cubic in dimension, under certain conditions. We extend the framework to Quantile Adaptive Search with Estimation, which focuses sampling points from a series of nested quantile level sets. The analyses suggest that computational effort is better expended on sampling improving points than refining estimates of objective function values during the progress of an adaptive search algorithm.

Recommendations

• Simulation optimization using multi-time-scale adaptive random search
• Exploring or reducing noise? A global optimization algorithm in the presence of noise
• Hesitant adaptive search for global optimisation
• Adaptive random search for continuous simulation optimization
• One-dimensional global optimization for observations with noise

Cites work

• (Global) optimization: historical notes and recent developments
• A direct stochastic algorithm for global search
• A Survey of Some Model-Based Methods for Global Optimization
• Adaptive random search for continuous simulation optimization
• An analytically derived cooling schedule for simulated annealing
• Backtracking adaptive search: distribution of number of iterations to convergence
• Generating functions and the performance of backtracking adaptive search
• Global optimization. Theory, algorithms, and applications
• Handbook of simulation optimization
• Hesitant adaptive search for global optimisation
• Hesitant adaptive search: The distribution of the number of iterations to convergence
• scientific article; zbMATH DE number 5309432 (Why is no real title available?)
• scientific article; zbMATH DE number 2117227 (Why is no real title available?)
• scientific article; zbMATH DE number 757687 (Why is no real title available?)
• Ordinal optimisation and simulation
• Ordinal Optimization
• Pure adaptive search for finite global optimization
• Pure adaptive search in global optimization
• Recent developments and trends in global optimization
• Single Observation Adaptive Search for Continuous Simulation Optimization
• Single observation adaptive search for discrete and continuous stochastic optimization
• Stochastic adaptive search for global optimization.
• Stochastic Algorithms: Foundations and Applications
• Stopping and restarting strategy for stochastic sequential search in global optimization
• The sample average approximation method for stochastic discrete optimization

Cited in

(1)

• Hesitant adaptive search for global optimisation

This page was built for publication: Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166097)