Using threshold autoregressive specifications, this paper extends the Enders and Granger (1998) framework for parametric tests of level asymmetry. In particular it develops bootstrap likelihood ratio statistics to test the symmetry null against sign and amplitude asymmetries or a combination of...

To create their rankings, university-ranking agencies usually combine multiple performance measures into a composite index. However, both rankings and index scores are sensitive to the weights assigned to performance measures. This paper uses a stochastic dominance efficiency methodology to...

In this paper we consider the object oriented implementation of numerical algorithms where arithmetic operators (add, mult, exp) operate on objects with more complex structure (compared to floating point numbers). Examples are objects representing vectors instead of scalars, random variables,...

Keane's bump function is considered as a standard benchmark for nonlinear constrained optimization. It is highly multi-modal and its optimum is located at the non-linear constrained boundary. The true minimum of this function is, perhaps, unknown. We intend in this paper to optimize Keane's...

In this paper we compare the performance of the Barter method, a newly introduced population-based (stochastic) heuristic to search the global optimum of a (continuous) multi-modal function, with that of two other well-established and very powerful methods, namely, the Simulated Annealing (SA)...

The objective of this paper is to introduce a new population-based (stochastic) heuristic to search the global optimum of a (continuous) multi-modal function and to assess its performance (on a fairly large number of benchmark functions) vis-a-vis that of two other well-established and very...

The Repulsive Particle Swarm (RPS) method of global optimization is perhaps the simplest to understand and implement. Due to its simplicity, it can be easily modified to suit the purpose and therefore, it has better prospects as well. The method has been frequently used in the field of...

Programs that work very well in optimizing convex functions very often perform poorly when the problem has multiple local minima or maxima. They are often caught or trapped in the local minima/maxima. Several methods have been developed to escape from being caught in such local optima. The...

In this paper an attempt has been made to fit the Gielis curves (modified by various functions) to simulated data. The estimation has been done by two methods - the Classical Simulated Annealing (CSA) and the Particle Swarm (PS) methods - of global optimization. The Repulsive Particle Swarm...

Options with embedded early exercise features are of fundamental importance in finance. A simple example is the hedge of a multi-callable bond. This instrument is hedged using a Bermudan swaption.Bermudan swaptions also play a key role when pricing callable constant maturity swaps or flexible...