Assume that F is a nonlinear operator on a real Hilbert space H which is strongly monotone and Lipschitzian with constants η > 0 and κ > 0, respectively on a nonempty closed convex subset C of H . Assume also that C is the intersection of the fixed point sets of a finite number of nonexpansive mappings on H . We develop an implicit hybrid steepest-descent method which generates an iterative seq...

In this paper, we propose a simple set theoretic blind deconvolution scheme based on a recently developed convex projection technique called Hybrid Steepest Descent Methods. The scheme is essentially motivated by Kundur and Hatzinakos’s idea that minimizes a certain cost function uniformly reflecting all a priori information such that (i) nonnegativity of the true image and (ii) support size of...

Recently, a hybrid methodology for combining genetic algorithms and local search algorithms has received considerable attention. This paper proposes an extended hybrid genetic algorithm to further improve the performance of finding the optimal solution in a large search space. Three key ideas, i.e. the elitism, nonredundant search, and steepest-ascent hill climbing, are introduced into a standa...

Hybrid zones are regions where individuals from genetically differentiated populations meet and mate, resulting in at least some offspring of mixed ancestry. Patterns of gene flow (introgression) in hybrid zones vary across the genome, allowing assessment of the role of individual genes or genome regions in reproductive isolation. Here, we document patterns of introgression between two recently...

We have derived the electromagnetic fields for dipole antennas embedded in a two-layer dissipative medium by using the following techniques: (1) the brute-force numerical-integration method, (2) the modal approach by finding the residues for the integrals, (3) the image-source approach in conjunction with the steepest descent method, (4) and the hybrid technique with the combination of the two ...

The steepest descent method has a rich history and is one of the simplest and best known methods for minimizing a function. While the method is not commonly used in practice due to its slow convergence rate, understanding the convergence properties of this method can lead to a better understanding of many of the more sophisticated optimization methods. Here, we give a short introduction and dis...

This paper deals with the solving of variational inequality problem where constrained set is given as intersection a number fixed-point sets. To this end, we present an extrapolated sequential constraint method. At each iteration, proposed method updated based on ideas hybrid conjugate gradient used to accelerate well-known steepest descent method, and cyclic cutter for common problem. We prove...