Affiliations: Department of Statistics, Carnegie-Mellon University, Pittsburgh, PA 15217 | Department of Optimization, Institute of Mathematics and Informatics, 2600 Vilnius, Akademijos St.4, Lithuania | School of Chemical Engineering, Purdue University, W.Lafayette, IN 47907-1283
Abstract: We consider here the average deviation as the most important objective when designing numerical techniques and algorithms. We call that a Bayesian approach. We start by describing the Bayesian approach to the continuous global optimization. Then we show how to apply the results to the adaptation of parameters of randomized techniques of optimization. We assume that there exists a simple function which roughly predicts the consequences of decisions. We call it heuristics. We define the probability of a decision by a randomized decision function depending on heuristics. We fix this decision function, except for some parameters that we call the decision parameters. We repeat the randomized decision procedure several times given the decision parameters and regard the best outcome as a result. We optimize the decision parameters to make the search more efficient. Thus we replace the original optimization problem by an auxiliary problem of continuous stochastic optimization. We solve the auxiliary problem by the Bayesian methods of global optimization. Therefore we call the approach as the Bayesian one. We discuss the advantages and disadvantages of the Bayesian approach. We describe the applications to some of discrete programming problems, such as optimization of mixed Boolean bilinear functions including the scheduling of batch operations and the optimization of neural networks.
