Independent component analysis is a challenging problem in the area of unsupervised adaptive filtering. Recently, there has been an increasing interest in using geometric optimisation for adaptive filtering. The performance of ICA algorithms significantly depends on the choice of the contrast function and the optimisation algorithm used in obtaining the demixing matrix. In this paper we focus o...

This paper shows how parallelism has been integrated into SCOOP, a C++ class library for solving optimisation problems. After a description of the modeling and the optimisation parts of SCOOP, two new classes that permit parallel optimisation are presented: a class whose only purpose is to handle messages and a class for managing optimiser and message handler objects. Two of the most interestin...

This paper presents an approach to distributed optimisation applied to the problem of teaching space utilisation in a college. We describe the basic ingredients of the problem and analyse various solutions, some produced in a centralised environment and some in a distributed environment. The main aim is to investigate how distributed optimisation may be formulated. In particular we introduce a ...

Many algorithms have been devised for tackling combinatorial optimisation problems (COPs). Traditional Operations Research (OR) techniques such as Branch and Bound and Cutting Planes Algorithms can, given enough time, guarantee an optimal solution as they explicitly exploit features of the optimisation function they are solving. Specialised heuristics exist for most COPs that also exploit featu...

An analog minimum-variance unbiased estimator (MVUE) over an asymmetric wireless sensor network is studied. Minimisation of variance is cast into a constrained non-convex optimisation problem. An explicit algorithm that solves the problem is provided. The solution is obtained by decomposing the original problem into a finite number of convex optimisation problems with explicit solutions. These ...

Cuckoo search (CS) is one of the most recent population-based meta-heuristics. CS algorithm is based on the cuckoo’s behaviour and the mechanism of Lévy flights. Unfortunately, the standard CS algorithm is proposed only for continuous optimisation problems. In this paper, we propose a discrete binary cuckoo search (BCS) algorithm in order to deal with binary optimisation problems. To get binary...

Pose estimation from an arbitrary number of 2-D to 3D feature correspondences is often done by minimising a nonlinear criterion function using one of the minimal representations for the orientation. However, there are many advantages in using unit quaternions to represent the orientation. Unfortunately, a straightforward formulation of the pose estimation problem based on quaternions results in...

This paper addresses the problem of developing an optimisation model to aid the operational decision-making process in pipeline systems. The model is applied on a real world pipeline oil distribution scenario, which connects an inland refinery to a harbour, conveying multiple types of commodities. The optimisation model was developed based on mixed integer linear programming (MILP) with uniform...