one of the main concerns of processing algorithms used in synthetic aperture radar (sar) with a ballistic motion is the compensation of all phase errors in the data received from the target to achieve a clear picture of the target. in this article, by using range doppler algorithm and phase-gradient auto focus algorithm, imagery in one sar with a ballistic motion is considered according to the ...

The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search process will become very slow. On the contrary, the gradient descending method can achieve faster convergent speed around global optimum, and at the same time, the convergent accuracy can be higher. So in this paper, a hybrid algorithm comb...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy GLOBAL OPTIMIZATION ALGORITHMS FOR ADAPTIVE INFINITE IMPULSE RESPONSE FILTERS By Ching-An Lai December 2002 Chair: José C. Principe Major Department: Electrical and Computer Engineering The major goal of this dissertation is to develop g...

The global positioning system (GPS) provides accurate positioning and timing information useful in many applications. An adaptive lattice predictor for the anti-jamming purpose will be proposed. The adaptive filter is applied here to accurately predict the narrowband waveform based on an effective and computationally efficient stochastic-gradient algorithm. Simulation results show that our prop...

The genetic algorithm (GA) have good global search characteristics and local optimizing algorithm (LOA) have good local search characteristics. In the present work, best characteristics of GA and LOA are combined to develop a hybrid genetic algorithm (HGA). A bank of GA s are used to get a good starting solution for a conjugate gradient algorithm. The number of GA banks is selected using an aut...

Genetic algorithms (GAs) have been extensively used in different domains as a means of doing global optimization in a simple yet reliable manner. They have a much better chance of getting to global optima than gradient-based methods which usually converge to local sub-optima. However, GAs have a tendency of getting only moderately close to the optima in a small number of iterations. To get very...

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

Optimization methods for a given class are easily modified to utilize additional information and work faster on a more·restricted class. In particular algorithms that use only the Lipschitz constant (e.g. Mladineo, Piyavskii, Shubert and Wood) can be modified to use second derivative bounds or gradient calculations. The algorithm of Breiman & Cutler can be modified to use Lipschitz bounds. Test...