We study the operator monotonicity of the inverse of every polynomial with a positive leading coefficient. Let {pn}n=0 be a sequence of orthonormal polynomials and pn+ the restriction of pn to [an,∞), where an is the maximum zero of pn. Then p −1 n+ and the composite pn−1 ◦ p −1 n+ are operator monotone on [0,∞). Furthermore, for every polynomial p with a positive leading coefficient there is a...

whereΔp is the p-Laplacian, Ω ∈ C0,1 be a bounded domain inRN . Let p ≥ 2, λ > 0 and f : Ω×R −→ R be a caratheodory function which is decreasing with respect to the second variable, i.e., f(x, s1) ≥ f(x, s2) for a.a. x ∈ Ω ands1, s2 ∈ R, s1 ≤ s2 (2) Assume, moreover, that there exists f0 ∈ Lp(Ω), p′ = p p−1 and c > 0 such that ∣f(x, s)∣ ≤ f0(x) + c∣s∣p−1 (3) We considered such problems with num...

The theory of weighted inequalities for the Hardy operator, acting on monotone functions in R+, was first introduced in [2]. Extensions of these results to higher dimensions have been considered only in very specific cases: in particular, in the diagonal case, for p = 1 only (see [3]). The main difficulty in this context is that the level sets of the monotone functions are not totally ordered, ...

The theory of weighted inequalities for the Hardy operator, acting on monotone functions in R+, was first introduced in [2]. Extensions of these results to higher dimension have been considered only in very specific cases. In particular, in the diagonal case, only for p = 1 (see [5]). The main difficulty in this context is that the level sets of the monotone functions are not totally ordered, c...

A new monotonicity, M-monotonicity, is introduced, and the resolvant operator of an M-monotone operator is proved to be single-valued and Lipschitz continuous. With the help of the resolvant operator, the positively semidefinite general variational inequality (VI) problem VI (S+,F +G) is transformed into a fixed point problem of a nonexpansive mapping. And a proximal point algorithm is construc...

We propose a generalized proximal point algorithm (PPA), in the generic setting of finding a root of a maximal monotone operator. In addition to the classical PPA, a number of benchmark operator splitting methods in the PDE and optimization literatures can be retrieved by this generalized PPA scheme. We establish the convergence rate of this generalized PPA scheme under different conditions, in...

Sufficient conditions for an equilibrium of maximal monotone operator to be in a given set are provided. This partially answers to a question posed in [10].

Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators which generalizes all main semantics of logic programming, default logic and autoepistemic logic. In this paper, we study inductive constructions using operators and show their confluence to the well-founded fixpoint of the operator. This result is one argument for the thesis that Approximation theory is ...

A new type of approximating curve for finding a particular zero of the sum of two maximal monotone operators in a Hilbert space is investigated. This curve consists of the zeros of perturbed problems in which one operator is replaced with its Yosida approximation and a viscosity term is added. As the perturbation vanishes, the curve is shown to converge to the zero of the sum that solves a part...