Described here is a method, based on Glover's taboo search for discrete functions, of solving the multiple minima problem for continuous functions. As demonstrated by model calculations, the algorithm avoids entrapment in local minima and continues the search to give a near-optimal final solution. Unlike other methods of global optimization, this procedure is generally applicable, easy to implement, derivative-free, and conceptually simple.
Maximon has recently given an excellent summary of the properties of the Euler dilogarithm function and the frequently used generalizations of the dilogarithm, the most important among them being the polylogarithm function Li s ( z ). The polylogarithm function appears in several fields of mathematics and in many physical problems. We, by making use of elementary arguments, deduce several new integral representations of the polylogarithm Li s ( z ) for any complex z for which | z |1. The other two involve the Bernoulli polynomials and are valid in the important special case where the parameter s is a positive integer. Our earlier established results on the integral representations for the Riemann zeta function ζ (2 n +1), n ∈ N , follow directly as corollaries of these representations.