Adaptive partitioned random search to global optimization

DOI10.1109/9.333768MaRDI QIDQ4315679zbMATH OpenOpenAlexFDO

Authors

Publication date 3 October 1996

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.333768

zbMATH Keywords

adaptive partitioned random searchglobal optimizationtree search

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
• Partitioned random search for global optimization with sampling cost and discounting factor
• scientific article; zbMATH DE number 4108054
• On Accelerated Random Search

Cited in

(28)

• Optimal sequential sampling policy of partitioned random search and its approximation
• Hesitant adaptive search for global optimisation
• FRACTOP: A geometric partitioning metaheuristic for global optimization
• Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
• Partitioned random search for global optimization with sampling cost and discounting factor
• Adaptive random search in quasi-Monte Carlo methods for global optimization
• A peak-over-threshold search method for global optimization
• An efficient simulation optimization method for the generalized redundancy allocation problem
• Analysis and parameter selection for an adaptive random search algorithm
• Pure adaptive search for finite global optimization
• \textsc{Oscars}-II: an algorithm for bound constrained global optimization
• One side cut accelerated random search
• A probabilistic cooperative-competitive hierarchical model for global optimization
• The robust constant and its applications in random global search for unconstrained global optimization
• A cover partitioning method for bound constrained global optimization
• A two phase local global search algorithm using new global search strategy
• Online optimization of replacement policies using learning automata
• Improved global convergence probability using multiple independent optimizations
• scientific article; zbMATH DE number 3952512 (Why is no real title available?)
• CARTopt: a random search method for nonsmooth unconstrained optimization
• scientific article; zbMATH DE number 2050745 (Why is no real title available?)
• scientific article; zbMATH DE number 2050762 (Why is no real title available?)
• A note on a partitioning algorithm for global optimization with reference to Tang's statistical promise measure
• On Accelerated Random Search
• Predictive search for capacitated multi-item lot sizing problems
• Implementing pure adaptive search for global optimization using Markov chain sampling
• Dynamic sample budget allocation in model-based optimization
• Learning mixture models via component-wise parameter smoothing

This page was built for publication: Adaptive partitioned random search to global optimization

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