The classical canonical correlation analysis is extremely greedy to maximize the squared correlation between two sets of variables. As a result, if one of the variables in the dataset-1 is very highly correlated with another variable in the dataset-2, the canonical correlation will be very high...

In this paper we test a particular variant of the (Repulsive) Particle Swarm method on some rather difficult global optimization problems. A number of these problems are collected from the extant literature and a few of them are newly introduced. First, we introduce the Particle Swarm method of...

This paper aims at comparing the performance of the Differential Evolution (DE) and the Repulsive Particle Swarm (RPS) methods of global optimization. To this end, some relatively difficult test functions have been chosen. Among these test functions, some are new while others are well known in...

Correlation matrices have many applications, particularly in marketing and financial economics. The need to forecast demand for a group of products in order to realize savings by properly managing inventories requires the use of correlation matrices. In many cases, due to paucity of...

The Pearsonian coefficient of correlation as a measure of association between two variates is highly prone to the deleterious effects of outlier observations (in data). Statisticians have proposed a number of formulas to obtain robust measures of correlation that are considered to be less...

In this paper we have proposed a method to conduct the ordinal canonical correlation analysis (OCCA) that yields ordinal canonical variates and the coefficient of correlation between them, which is analogous to (and a generalization of) the rank correlation coefficient of Spearman. The ordinal...

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-à-vis that of two other well-established and very...

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 simulation we often have to generate correlated random variables by giving a reference intercorrelation matrix, R or Q. The matrix R is positive definite and a valid correlation matrix. The matrix Q may appear to be a correlation matrix but it may be invalid (negative definite). With R(m,m)...

The nearest correlation matrix problem is to find a valid (positive semidefinite) correlation matrix, R(m,m), that is nearest to a given invalid (negative semidefinite) or pseudo-correlation matrix, Q(m,m); m larger than 2. In the literature on this problem, 'nearest' is invariably defined in...