• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.195-198
• /
• 2007

In this paper, we consider Lebesgue-type theorems in non-additive measure theory and then investigate interval-valued Choquet integrals and interval-valued fuzzy integral with respect to a additive monotone set function. Furthermore, we discuss the equivalence among the Lebesgue's theorems, the monotone convergence theorems of interval-valued fuzzy integrals with respect to a monotone set function and find some sufficient condition that the monotone convergence theorem of interval-valued Choquet integrals with respect to a monotone set function holds.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.749-753
• /
• 2007

In this paper, we consider Lebesgue-type theorems in non-additive measure theory and then investigate interval valued Choquet integrals and interval-valued fuzzy integral with respect to a additive monotone set function. Furthermore, we discuss the equivalence among the Lebesgue's theorems, the monotone convergence theorems of interval-valued fuzzy integrals with respect to a monotone set function and find some sufficient condition that the monotone convergence theorem of interval-valued Choquet integrals with respect to a monotone set function holds.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.2
• /
• pp.147-155
• /
• 2008

In this paper, we consider proximal point algorithms based on ($A,{\eta}$)-monotone mappings in the framework of Hilbert spaces. Since ($A,{\eta}$)-monotone mappings generalize A-monotone mappings, H-monotone mappings and many other mappings, our results improve and extend the recent ones announced by [R.U. Verma, Rockafellars celebrated theorem based on A-maximal monotonicity design, Appl. Math. Lett. 21 (2008), 355-360] and [ R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim. 14 (1976) 877-898] and some others.

• Honam Mathematical Journal
• /
• v.30 no.1
• /
• pp.171-183
• /
• 2008

In a previous work [18], the authors investigated autocontinuity, converse-autocontinuity, uniformly autocontinuity, uniformly converse-autocontinuity, and fuzzy multiplicativity of monotone set function defined by Choquet integral([3,4,13,14,15]) instead of fuzzy integral([16,17]). We consider nonnegative monotone interval-valued set functions and nonnegative measurable interval-valued functions. Then the interval-valued Choquet integral determines a new nonnegative monotone interval-valued set function which is a generalized concept of monotone set function defined by Choquet integral in [18]. These integrals, which can be regarded as interval-valued aggregation operators, have been used in [10,11,12,19,20]. In this paper, we investigate some characterizations of monotone interval-valued set functions defined by the interval-valued Choquet integral such as autocontinuity, converse-autocontinuity, uniform autocontinuity, uniform converse-autocontinuity, and fuzzy multiplicativity.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.293-309
• /
• 2011

The purpose of this article is to prove strong convergence theorems for weak relatively nonexpansive mapping which is firstly presented in this article. In order to get the strong convergence theorems for weak relatively nonexpansive mapping, the monotone CQ iteration method is presented and is used to approximate the fixed point of weak relatively nonexpansive mapping, therefore this article apply above results to prove the strong convergence theorems of zero point for maximal monotone operators in Banach spaces. Noting that, the CQ iteration method can be used for relatively nonexpansive mapping but it can not be used for weak relatively nonexpansive mapping. However, the monotone CQ method can be used for weak relatively nonexpansive mapping. The results of this paper modify and improve the results of S.Matsushita and W.Takahashi, and some others.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.371-381
• /
• 1997

Our basic concern in this paper is to investigate some geometric properties of the graph of a maximal monotone operator in the one dimensional case. Using a well-known theorem of Minty, we answer S. Simon's questions affirmatively in the one dimensional case. Further developments of these results are also treated. In addition, we provide a new proof of Rockafellar's characterization of maximal monotone operators on R: every maximal monotne operator from R to $2^R$ is the subdifferential of a proper convex lower semicontinuous function.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.1-6
• /
• 2008

In this paper, we introduce a system of nonlinear variational inclusions involving (A, $\eta$)-monotone mappings in the framework of Hilbert spaces. Based on the generalized resolvent operator technique associated with (A, $\eta$)-monotonicity, the approximation solvability of solutions using an iterative algorithm is investigated. Our results improve and extend the recent ones announced by many others.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1437-1445
• /
• 1999

n개의 꼭지점을 가진 단조(monotone) 다각형은 2차원 평면상의 임의의 선분에 단조 적인 2개의 체인으로 구성된다. 단조 다각형의 내부를 경로 상에서 모두 감시할 수 있는 최소 링크를 가진 경비원 경로(watchman route with minimum links)는 최소 개수의 선분으로 구성된 경로로서 하나 이상 존재할 수 있다. 본 논문에서는 단조 다각형의 최소 링크를 가진 경비원 경로들 중에서 최단 경비원 경로를 구하는 O(n) 시간의 알고리즘을 제시한다.Abstract A monotone polygon consists of n vertices and is a union of two monotone chains with respect to some line segment in the plane. A watchman route with minimum-links is a polygonal path such that each point in the interior of the polygon can be visible from at least one point along the route. There may be more than one watchman route with minimum links for given monotone polygon. In this paper, we present an algorithm with O(n) time that finds a shortest watchman route among the watchman routes with minimum links in a monotone polygon.

• Bulletin of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.297-308
• /
• 1994

In [5], M. Cwikel and J. Peetre showed that some Banach couples are Calderon pairs and every K-monotone cones in that couples can be constructed by the Peetre K-method. With the help of theorem 4 in [3], we can extend the above result to the K-monotone spaces. In [4], M. Cwikel provided the proof of therem 4 in [3] and also mentioned that some theorems in [5] which were stated in terms of K-monotone cones can be extended to K-monotone spaces. But M. Cwikel and J.Peetre's results only cover the case when over bar A = over bar B. We extend this result to the case when over bar A.neq. over bar B. In this case, we need a condition stronger than that the K-monotone space.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.839-853
• /
• 2021

Let 𝕽ⁿ be an Euclidean space and g : 𝕽ⁿ → 𝕽ⁿ be a monotone and continuous mapping. Suppose the convex constrained nonlinear monotone equation problem x ∈ 𝕮 s.t g(x) = 0 has a solution. In this paper, we construct an inertial-type algorithm based on the three-term derivative-free projection method (TTMDY) for convex constrained monotone nonlinear equations. Under some standard assumptions, we establish its global convergence to a solution of the convex constrained nonlinear monotone equation. Furthermore, the proposed algorithm converges much faster than the existing non-inertial algorithm (TTMDY) for convex constrained monotone equations.