Such a set G is said to be maximal monotone if it is maximal among monotone sets in the sense of set inclusion, and a mapping T is said to be maximal monotone if its graph G(T) is a maximal monotone set. For reflexive Banach spaces X and mappings T with D(T)~X, the basic result obtained independently by Browder [2] and Minty [20] states that if T is a monotone operator from D(T)=X to X* which i...

AIM To construct the expression vector of B3 (scdsFv)-SEA (D227A) and to identify its binding and cytotoxic ability to B3 antigen positive carcinoma cell lines. METHODS This fusion protein was produced by a bacterial expression system in this study. It was expressed mainly in the inclusion body. The gene product was solubilized by guanidine hydrochloride, refolded by conventional dilution met...

Abstract. We consider 3-monotone approximation by piecewise polynomials with prescribed knots. A general theorem is proved, which reduces the problem of 3-monotone uniform approximation of a 3-monotone function, to convex local L1 approximation of the derivative of the function. As the corollary we obtain Jackson-type estimates on the degree of 3-monotone approximation by piecewise polynomials ...

In this paper, we introduce a Mann-Krasnoselskii algorithm of inertial form for approximating common solution Spit Variational Inclusion Problem (SVIP) and Equilibrium (EP) with paramonotone bifunction in real Hilbert spaces. Motivated by the self-adaptive technique, incorporate technique to accelerate convergence proposed method. Under standard mild assumptions such as monotonicity lower semic...

Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties of monotone span programs related to their size. Using the results of van Dijk (connecting codes and MSPs) and a construction for a dual monotone span program proposed by Cramer and Fehr we prove a non-trivial upper bound for ...

‎a full nesterov-todd (nt) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using euclidean jordan algebra‎. ‎two types of‎ ‎full nt-steps are used‎, ‎feasibility steps and centering steps‎. ‎the‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. Therefore, k-monotone functions are natural generalizations of the classical monotone functions, which are the 1-monotone functions. Motivated by the recent interest in k-monotone functions in the context of circuit complexity and learning theory,...

In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...

the paper presents an economical model for double variable acceptance sampling with inspection errors. taguchi cost function is used as acceptance cost while quality specification functions are normal with known variance. an optimization model is developed for double variables acceptance sampling scheme at the presence of inspection errors with either constant or monotone value functions. the m...

In this paper we consider various methods for nonmetric multidimensional scaling. We focus on the nonmetric phase, for which we consider various alternatives: Kruskal’s nonmetric phase, Guttman’s nonmetric phase, monotone regression by monotone splines, and monotone regression by a monotone neural network. All methods are briefly described. We use sequential quadratic programming to estimate th...