| Sumario: | Abstract: In many practical problems, we need to find the values of the parameters that
optimize the desired objective function. For example, for the toll roads, it is important to set
the toll values that lead to the fastest return on investment.
There exist many optimization algorithms, the problem is that these algorithms often end up in
a local optimum. One of the promising methods to avoid the local optima is the filled function
method, in which we, in effect, first optimize a smoothed version of the objective function,
and then use the resulting optimum to look for the optimum of the original function. It turns
out that empirically, the best smoothing functions to use in this method are the Gaussian
and the Cauchy functions. In this paper, we show that from the viewpoint of computational
complexity, these two smoothing functions are indeed the simplest.
The Gaussian and Cauchy functions are not a panacea: in some cases, they still leave us with
a local optimum. In this paper, we use the computational complexity analysis to describe the
next-simplest smoothing functions which are worth trying in such situations.
Keywords: optimization; toll roads; filled function method; Gaussian and Cauchy smoothing
|
|---|
