[PDF] Top 20 As vantagens da segurança do trabalho na industria da construção civil

... In recent times, this type of functional has been studied extensively by many authors including Alber [1], Alber and Guerre-Delabriere [2], Kamimura and Takahashi [10], Reich [13]. It has proved to be a very useful tool ... See full document

... In this section, we establish several results which will be used for construction and sub- stantiation of an iterative solution method for problem (2.6). Recall that, on account of Proposition 2.2, this ... See full document

... Many problems in mathematics, for example in physical sciences, in engineering and in real-world applications of various technological innovations can be modeled as ...Hilbert spaces which captures ... See full document

... Let H be a real Hilbert space and let C be nonempty closed convex subset of H. Recall that a mapping S of C into itself is called nonexpansive if Sx − Sy ≤ x − y for all x , y ∈ C . We denote by F ( S ) the ... See full document

... operator and propose a generalized viscosity approximation method for solving the unconstrained convex optimization problems in a real Hilbert space H. We show that, under reasonable ... See full document

... in real Hilbert ...proposed iterative algorithm to solve three typical optimization problems including the variational inequal- ities problem, constrained convex minimization problem, ... See full document

... in Lebesgue spaces with variable exponent, as well as the investigation of problems of regularity of nonlinear equations with nonstandard growth condition have become of late the arena of an ... See full document

... of iterative methods have been developed for finding out the solution of single variable nonlinear equations as well for the solution of a system of nonlinear ... See full document

... a real Banach space, E ∗ is the dual space of E, C is a nonempty closed convex subset of E, F(T) is the set of fixed points of map- ping T , · , · is the generalized duality pairing between E and E ∗ , and ... See full document

... The function 1 / α − R ( ) ω can be verified to be conver in the variables (r, α ) (since α > 0 ). Indeed, when sampled this problem can be very efficiently solved as a second-order come program (SOCP). The passband ... See full document

... proposed method are that the minimum number of array sensors for beampattern designs is computed in a systematic way via bisection and the number of iterations before it stops, is ...proposed method, only 5 ... See full document

... feasibility problems, the purpose of this article is to introduce an iterative algorithm for equilibrium problems and split feasibility problems in Hilbert ...equilibrium problems and ... See full document

... (1) Theorem 3.1, Corollary 3.2, Corollary 3.3, and Corollary 3.4 improve and develop the corresponding results, which were obtained recently by many authors in various references, for example, see [2,3,7-9,11-18,24,30]. ... See full document

... descent-conjugate gradient algorithm for the split variational inclusion problems in Hilbert spaces. Next, a strong convergence theorem of the proposed algorithm is proved under suitable conditions. As an ... See full document

... uniformly convex and uniformly smooth Banach spaces and studied their properties in ...uniformly convex and uniformly smooth Banach spaces to reflexive Banach spaces, and established a ... See full document

... an iterative algorithm with regularization to solve such a variational inequality problem and study the strong convergence of the sequence generated by the proposed ... See full document

... Motivated and inspired by research work mentioned above, in this paper, we study the LP and Hadamard well-posedness for the system of generalized quasi-variational inclu- sion problems. This paper is organized as ... See full document

... where f : C → R is a real valued convex function. Assume that the minimization problem (.) is consistent, and let S denote its solution set. It is known that the gradient-projection algorithm is one of ... See full document

... a real normed space E to its dual space E ∗ has very recently been introduced and studied (see Chidume and Idu [12], Liu [24], Zegeye ...and convex minimization problems, the reader is referred to ... See full document

... point method (shortly, PPM) [21] and the other one is an auxiliary problem principle ...inequality problems, and later it was continued by Rockafellar [24] for monotone ...PPM method is implemented ... See full document