نتایج جستجو برای: multiplier bounded approximate identity
تعداد نتایج: 264048 فیلتر نتایج به سال:
We investigate nonlinear programs that have a nonempty but possibly unbounded Lagrange multiplier set and that satisfy the quadraticgrowth condition. We show that such programs can be transformed, by relaxing the constraints and adding a linear penalty term to the objective function, into equivalent nonlinear programs that have diierentiable data and a bounded Lagrange multiplier set and that s...
Multipliers in weighted settings and strong convergence of associated operator-valued Fourier series
This note describes the pleasant features that accrue in weighted settings when the partial sums of the operator-valued Fourier series corresponding to a multiplier function ψ : T → C are uniformly bounded in operator norm. This circle of ideas also includes a Tauberiantype condition on the multiplier function ψ sufficient to insure such uniform boundedness of partial sums. These considerations...
This paper analyzes sequences generated by infeasible interior point methods. In convex and nonconvex settings, we prove that moving the primal feasibility at the same rate as complementarity will ensure that the Lagrange multiplier sequence will remain bounded, provided the limit point of the primal sequence has a Lagrange multiplier, without constraint qualification assumptions. We also show ...
In this note, we announce some results about the Schur multipliers of the known finite simple groups. Proofs will appear elsewhere. We shall conclude with a summary of current knowledge on the subject. Basic properties of multipliers and covering groups of finite groups are discussed in [6]. Notation for groups of Lie type is standard [3], [8]. G' denotes the commutator subgroup of the group G,...
Any finite-dimensional Hopf algebra has a left and a right integral. Conversely, Larsen and Sweedler showed that, if a finite-dimensional algebra with identity and a comultiplication with counit has a faithful left integral, it has to be a Hopf algebra. In this paper, we generalize this result to possibly infinite-dimensional algebras, with or without identity. We have to leave the setting of H...
In this paper we consider translation invariant operators with additional symmetry coming from group actions. As the classic Hilbert and Riesz transforms can be characterized up to scalar by means of relative invariance of conformal transformation groups, certain multiplier operators are characterized by relative invariance of some other affine subgroups. In this article, we formalize a geometr...
in this thesis we will present three topics. we define approximate fixed points in fuzzy normed spaces. also we obtain some necessary and sufficient conditions on the existence of? -fixed points for ? > 0. at the continue some results about approximate fixed points for a class of non-expansive maps on g-metric spaces are obtained and we define approximate fixed points in partial metric spa...
A novel four-quadrant analog multiplier using floating gate MOS (FGMOS) transistors operating in the saturation region is presented. The drain current is proportional to the square of the weighted sum of the input signals. This square law characteristic of the FGMOS transistor is used to implement the quarter square identity by utilizing only six FGMOS transistors. The main features of this rem...
-Using the He’s variational iteration method, it is possible to find the exact solutions or better approximate solutions of the partial differential equations. In this method, a correction functional is constructed by a general Lagrange multiplier, which can be identified via variational theory. In this paper, this method is used for solving a nonlinear partial differential equation, a three-di...
We undertake a thorough complexity study of the following fundamental optimization problem, known as the `p-norm shortest extended GCD multiplier problem: given a1, . . . , an ∈ Z, find an `p-norm shortest gcd multiplier for a1, . . . , an, i.e., a vector x ∈ Z with minimum ( ∑n i=1 |xi|) satisfying ∑n i=1 xiai = gcd(a1, . . . , an). First, we prove that the shortest GCD multiplier problem (in ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید