• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.375-381
• /
• 2008

Boundedness for the set of all the $\epsilon$-approximate solutions for convex optimization problems are considered. We give necessary and sufficient conditions for the sets of all the $\epsilon$-approximate solutions of a convex optimization problem involving finitely many convex functions and a convex semidefinite problem involving a linear matrix inequality to be bounded. Furthermore, we give examples illustrating our results for the boundedness.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.657-661
• /
• 2010

We study a singular function which we call a generalized cylinder convex(concave) function induced from different generalized dyadic expansion systems on the unit interval. We show that the generalized cylinder convex(concave)function is a singular function and the length of its graph is 2. Using a local dimension set in the unit interval, we give some characterization of the distribution set using its derivative, which leads to that this singular function is nowhere differentiable in the sense of topological magnitude.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1167-1174
• /
• 1999

In this paper, we present a new technique for the local decomposition of convex structuring elements for morphological image processing. Local decomposition of a structuring element consists of local structuring elements, in which each structuring element consists of a subset of origin pixel and its eight neighbors. Generally, local decomposition of a structuring element reduces the amount of computation required for morphological operations with the structuring element. A unique feature of our approach is the use of linear integer programming technique to determine optimal local decomposition that guarantees the minimal amount of computation. We defined a digital convex polygon, which, in turn, is defined as a convex structuring element, and formulated the necessary and sufficient conditions to decompose a digital convex polygon into a set of basis digital convex polygons. We used a set of linear equations to represent the relationships between the edges and the positions of the original convex polygon, and those of the basis convex polygons. Further. a cost function was used represent the total processing time required for computation of dilation/erosion with the structuring elements in a decomposition. Then integer linear programming was used to seek an optimal local decomposition, that satisfies the linear equations and simultaneously minimize the cost function.

• Communications for Statistical Applications and Methods
• /
• v.15 no.5
• /
• pp.675-685
• /
• 2008

This paper studies two sequential procedures to estimate a monotone convex function using $L_2$ monotonization and uniform convexification; one, denoted by FMSC, monotonizes the data first and then, convexifis the monotone estimate; the other, denoted by FCSM, first convexifies the data and then monotonizes the convex estimate. We show that two shape modifiers are not commutable and so does FMSC and FCSM. We compare them numerically in uniform error(UE) and integrated mean squared error(IMSE). The results show that FMSC has smaller uniform error(UE) and integrated mean squared error(IMSE) than those of FCSC.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.351-360
• /
• 2005

This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem.

• Honam Mathematical Journal
• /
• v.23 no.1
• /
• pp.41-50
• /
• 2001

This paper concerns with the subclass of normalized analytic function f in D = {z : |z| < 1}, namely a ${\delta}$-convex function in a sector. This subclass is denoted by ${\Delta}({\delta})$, where ${\delta}$ is a real positive. Given $0<{\beta}{\leq}1$ then for $z{\in}D$, the exact ${\alpha}({\beta},\;{\delta})$ is found such that $f{\in}{\Delta}({\delta})$ implies $f{\in}S^*({\beta})$, where $S^*({\beta})$ is starlike of order ${\beta}$ in a sector. This work is a more general version of the result of Nunokawa and Thomas [11].

• Honam Mathematical Journal
• /
• v.37 no.4
• /
• pp.513-527
• /
• 2015

In this paper, we first introduce and study new concepts of ($k_1,{\cdots},k_n$)-convexity and k-segment. Secondly, we shall discuss some properties of nonisotropically starlike domains in $\mathbb{R}^n$ with respect to the origin.

• Kyungpook Mathematical Journal
• /
• v.46 no.3
• /
• pp.337-343
• /
• 2006

In the present paper we shall prove that on a foundation *-semigroup S with an identity and with a locally bounded Borel measurable weight function ${\omega}$, the pointwise convergence and the uniform convergence of a sequence of ${\omega}$-bounded exponentially convex functions on S which are also continuous at the identity are equivalent.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.291-301
• /
• 2000

We give sufficient coefficient conditions for a class of meromorphic univalent harmonic functions that are starlike of some order. Furthermore, it is shown that these conditions are also necessary when the coefficients of the analytic part of the function are positive and the coefficients of the co-analytic part of the function are negative. Extreme points, convolution and convex combination conditions for these classes are also determined. Fianlly, comparable results are given for the convex analogue.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.717-723
• /
• 2021

The purpose of the present paper is to give sufficient conditions for normalized Dini function which is the special combination of the generalized Bessel function of first kind to be in the classes k-starlike functions and k-uniformly convex functions.