High breakdown estimation allows one to get reasonable estimates of the parameters from a sample of data even if that sample is contaminated by large numbers of awkwardly placed outliers. Two particular application areas in which this is of interest are multiple linear regression, and estimation of the location vector and scatter matrix of multivariate data. Standard high breakdown criteria for...

In this study, we propose multi-stage and hybrid real-coded genetic algorithm. In the proposed algorithm, there are two stages. In the first stage, Real-coded Genetic Algorithm with Active Constraints (RGAAC) is applied to find a solution that is close to the global optimum. In RGAAC, individuals who are out of the feasible region are pulled back into feasible region. Therefore, the effective s...

A new non-simplex active-set method for solving linear programs is presented. This method uses a ‘‘global’’ viewpoint of the problem, it starts without any iteration point and its basic characteristic is that the first feasible point determined by the method is, generally, an optimal solution. The computational results obtained for a range-space implementation are highly encouraging. 2003 Elsev...

Variational techniques for data assimilation, i.e., estimating orbits of dynamical models from observations, are revisited. It is shown that under mild hypotheses a solution to this variational problem exists. Using ideas from optimal control theory, the problem of uniqueness is investigated and a number of results (well known from optimal control) are established in the present context. The va...

In this paper a model and algorithmic solution are created to control the path planning decision processes of multiple cooperating autonomous aerial vehicles engaged in a search of an uncertain and risky environment. Methods to incorporate a priori and dynamic information about the targets and to incorporate threats in a three-dimensional environment into a computationally feasible dynamic prog...

Linear Programs (LPs) appear in a large number of applications and offloading them to the GPU is viable to gain performance. Existing work on offloading and solving an LP on GPU suggests that performance is gained from large sized LPs (typically 500 constraints, 500 variables and above). In order to gain performance from GPU for applications involving small to medium sized LPs, we propose batch...

in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

In order to see the influence of different variable parameters (initial pH of the solution, Fe++ concentration and H2O2 concentration) and the efficiency to remove Malachite Green dye (Basic Green 4) from aqueous solution, Fenton Oxidation method was employed. Then different parameters were studied using known concentration (150 mg/l) and initial COD (256 mg/l) of prepared dye synthetic solutio...

the paper presents unified analytical solution for combining high-frequency and low-frequency economic time-series by additive and proportional denton methods with parametrical dependence on the initial values of variable and indicator in evident form. this solution spans denton’s original and cholette’s advanced benchmarking initial conditions as the subcases. computational complexity of the o...

No part of this Journal may be reproduced in any form, by print, photoprint, mi-croolm or any other means without written permission from Faculty of Technical : Abstract We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost, the pivot rule produces a sequence of pivots s...