The hybrid proximal point algorithm introduced by Solodov and Svaiter allowing significant relaxation of the tolerance requirements imposed on the solution of proximal subproblems will be combined with the inertial method introduced by Alvarez and Attouch which incorporates second order information to achieve faster convergence. The weak convergence of the resulting method will be investigated ...

This paper explores the possibility of generating visual expressions in a highly interactive environment on the basis of hand movements and acceleration. A new method for displaying visualization is presented. This method is known as hybrid raster-laser projection; in this method two projections are combined to create a final visual. A Wii Remote Controller was used to capture a participant’s h...

Compressive sensing (CS) is a new signal acquisition paradigm which shows that far fewer samples are required to reconstruct sparse signals than previously thought. Although most of the literature focuses on signals sparse in a fixed orthonormal basis, recently the Signal Space CoSaMP (SSCoSaMP) greedy method was developed for the reconstruction of signals compressible in arbitrary redundant di...

We have developed a computational framework for accurate and efficient simulation of stochastic spatially inhomogeneous biochemical systems. The new computational method employs a fractional step hybrid strategy. A novel formulation of the finite state projection (FSP) method, called the diffusive FSP method, is introduced for the efficient and accurate simulation of diffusive transport. Reacti...

In this paper, we prove a strong convergence theorem for fixed points of sequence for multivalued nonexpansive mappings and a zero of maximal monotone operator in Banach spaces by using the hybrid projection method. Our results modify and improve the recent results in the literatures.

and Applied Analysis 3 It is clear that 1.7 is equivalent to 〈 Sx − Sy, x − y ≤ ∥x − y∥2, ∀x, y ∈ C. 1.8 The class of κ-strict pseudocontractions which was introduced by Browder and Petryshyn 17 in 1967 has been considered by many authors. It is easy to see that the class of strict pseudocontractions falls into the one between the class of nonexpansive mappings and the class of pseudocontractio...

In this paper, by using Bregman’s technique, we introduce and study the hybrid proximal-point methods for finding a common element of the set of solutions to a system of generalized equilibrium Problems and zeros of a finite family of maximal monotone operators in reflexive Banach spaces. Strong convergence results of the proposed hybrid proximal-point algorithms are also established under some...

We study various ensemble methods for hybrid neural networks. The hybrid networks are composed of radial and projection units and are trained using a deterministic algorithm that completely defines the parameters of the network for a given data set. Thus, there is no random selection of the initial (and final) parameters as in other training algorithms. Network independent is achieved by using ...

We discuss the Heston [Heston-1993] model with stochastic interest rates driven by Hull-White [Hull,White-1996] (HW) or Cox-Ingersoll-Ross [Cox, et al.-1985] (CIR) processes. Two projection techniques to derive affine approximations of the original hybrid models are presented. In these approximations we can prescibe a non-zero correlation structure between all underlying processes. The affine a...

We present the application of Genetic Programming (GP) in Branch and Bound (B&B) based Mixed Integer Linear Programming (MIP). The hybrid architecture introduced employs GP as a node selection expression generator: a GP run, embedded into the B&B process, exploits the characteristics of the particular MIP problem being solved, evolving a problem-specific node selection method. The evolved metho...