Learn More
It is pointed out that the so called momentum method, much used in the neural network literature as an acceleration of the backpropagation method, is a stationary version of the conjugate gradient method. Connections with the continuous optimization method known as heavy ball with friction are also made. In both cases, adaptive (dynamic) choices of the so(More)
The standard conjugate gradient (CG) method uses orthogonality of the residues to simplify the formulas for the parameters necessary for convergence. In adaptive filtering, the sample-by-sample update of the correlation matrix and the cross-correlation vector causes a loss of the residue orthogonality in a modified online algorithm, which, in turn, results(More)
A gradient system with discontinuous righthand side that solves an underdetermined system of linear equations in the L/sub 1/ norm is presented. An upper bound estimate for finite time convergence to a solution set of the system of linear equations is shown by means of the Persidskii form of the gradient system and the corresponding nonsmooth diagonal type(More)
The stability of predator-prey models, in the context of exploitation of renewable resources, subject to threshold policies (TP) is studied in this paper using the idea of backstepping and control Liapunov functions (CLF) well known in control theory, as well as the concept of virtual equilibria. TPs are defined and analysed for different types of one and(More)
In the most basic application of Ant Colony Optimization (ACO), a set of artificial ants find the shortest path between a source and a destination. Ants deposit pheromone on paths they take, preferring paths that have more pheromone on them. Since shorter paths are traversed faster, more pheromone accumulates on them in a given time, attracting more ants(More)