Adaptive partitioned random search to global optimization
From MaRDI portal
Publication:4315679
DOI10.1109/9.333768zbMath0846.90102OpenAlexW2132732677MaRDI QIDQ4315679
No author found.
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
Related Items (16)
The robust constant and its applications in random global search for unconstrained global optimization ⋮ A cover partitioning method for bound constrained global optimization ⋮ A peak-over-threshold search method for global optimization ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ CARTopt: a random search method for nonsmooth unconstrained optimization ⋮ An efficient simulation optimization method for the generalized redundancy allocation problem ⋮ Online optimization of replacement policies using learning automata ⋮ Dynamic sample budget allocation in model-based optimization ⋮ One side cut accelerated random search ⋮ Learning mixture models via component-wise parameter smoothing ⋮ A probabilistic cooperative-competitive hierarchical model for global optimization ⋮ \textsc{Oscars}-II: an algorithm for bound constrained global optimization ⋮ Optimal sequential sampling policy of partitioned random search and its approximation ⋮ A two phase local global search algorithm using new global search strategy ⋮ 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
This page was built for publication: Adaptive partitioned random search to global optimization
