We introduce a new iterative scheme for nding a common elementof the solutions set of a generalized mixed equilibrium problem and the xedpoints set of an innitely countable family of nonexpansive mappings in a Banachspace setting. Strong convergence theorems of the proposed iterative scheme arealso established by the generalized projection method. Our results generalize thecorresponding results...

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

Let ? be an open connected subset of the complex plane C and let T be a bounded linear operator on a Hilbert space H. For ? in ? let e the orthogonal projection onto the null-space of T-?I . We discuss the necessary and sufficient conditions for the map ?? to b e continuous on ?. A generalized Gram- Schmidt process is also given.

Projection pursuit regression (PPR) can be used to estimate a smooth function of several variables from noisy and scattered data. The estimate is a sum of smoothed one-dimensional projections of the variables. This paper discusses an extension of PPR to exponential family distributions, called generalized projection pursuit regression (GPPR). The proposed model allows multiple responses and non...

Perspective projection is a well-understood aspect of 3D graphics. It is not something that 3D programmers spend much time thinking about. Most OpenGL applications simply select a field of view, specify near and far clipping plane distances, and call gluPerspective or glFrustum. These functions suffice in the vast majority of cases. But there are a few assumptions implicit in these. gluPerspect...