• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.227-235
• /
• 2004

In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

• 융복합기술연구소 논문집
• /
• 제10권1호
• /
• pp.7-12
• /
• 2020

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

• 대한수학회지
• /
• 제45권2호
• /
• pp.513-525
• /
• 2008

Using known properties of superquadratic functions we obtain a sequence of inequalities for superquadratic functions such as the Converse and the Reverse Jensen type inequalities, the Giaccardi and the Petrovic type inequalities and Hermite-Hadamard's inequalities. Especially, when the superquadratic function is convex at the same time, then we get refinements of classical known results for convex functions. Some other properties of superquadratic functions are also given.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.325-331
• /
• 2007

To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equation $B_{k+1}s_k=y^*_k,\;where\;y^*_k$ is the sum of $y_k\;and\;A_ks_k,\;and\;A_k$ is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.

• Kyungpook Mathematical Journal
• /
• 제55권2호
• /
• pp.429-438
• /
• 2015

The objective of this paper is to obtain sharp upper bound for the second Hankel functional associated with the $k^{th}$ root transform $[f(z^k)]^{\frac{1}{k}}$ of normalized analytic function f(z) when it belongs to the class of starlike and convex functions with respect to symmetric points, defined on the open unit disc in the complex plane, using Toeplitz determinants.

• 대한수학회논문집
• /
• 제37권2호
• /
• pp.455-472
• /
• 2022

For j = 0, 1, 2,…, k - 1; k ≥ 2; and - 1 ≤ B < A ≤ 1, we have introduced the functions classes denoted by ST_[j,k](A, B) and K_[j,k](A, B), respectively, called the generalized (j, k)-symmetric starlike and convex functions. We first proved the sharp bounds on |f(z)| and |f'(z)|. Various radii related problems, such as radius of (j, k)-symmetric starlikeness, convexity, strongly starlikeness and parabolic starlikeness are determined. The quantity |a²₃ - a₅|, which provide the initial bound on Zalcman functional is obtained for the functions in the family ST_[j,k]. Furthermore, the sharp pre-Schwarzian norm is also established for the case when f is a member of K_[j,k](α) for all 0 ≤ α < 1.

• 대한수학회보
• /
• 제61권2호
• /
• pp.469-477
• /
• 2024

For a knot in the 3-sphere, the Upsilon invariant is a piecewise linear function defined on the interval [0, 2]. It is known that this invariant of an L-space knot is the Legendre-Fenchel transform (or, convex conjugate) of a certain gap function derived from the Alexander polynomial. To recover an information lost in the Upsilon invariant, Kim and Livingston introduced the secondary Upsilon invariant. In this note, we prove that the secondary Upsilon invariant of an L-space knot is a concave conjugate of a restricted gap function. Also, a similar argument gives an alternative proof of the above fact that the Upsilon invariant of an L-space knot is a convex conjugate of a gap function.

• Interaction and multiscale mechanics
• /
• 제2권2호
• /
• pp.129-151
• /
• 2009

This paper presents a meshfree procedure using a convex generalized meshfree (GMF) approximation for the large deformation analysis of particle-reinforced rubber compounds on microscopic level. The convex GMF approximation possesses the weak-Kronecker-delta property that guarantees the continuity of displacement across the material interface in the rubber compounds. The convex approximation also ensures the positive mass in the discrete system and is less sensitive to the meshfree nodal support size and integration order effects. In this study, the convex approximation is generated in the GMF method by choosing the positive and monotonic increasing basis function. In order to impose the periodic boundary condition in the unit cell method for the microscopic analysis, a singular kernel is introduced on the periodic boundary nodes in the construction of GMF approximation. The periodic boundary condition is solved by the transformation method in both explicit and implicit analyses. To simulate the interface de-bonding phenomena in the rubber compound, the cohesive interface element method is employed in corporation with meshfree method in this study. Several numerical examples are presented to demonstrate the effectiveness of the proposed numerical procedure in the large deformation analysis.

• 한국항공우주학회지
• /
• 제48권9호
• /
• pp.691-701
• /
• 2020

본 논문은 전기 추진 수직이착륙 무인기의 형상에 적합하도록 회전익 모드에서 추진시스템이 고장난 상황을 대처하기 위한 컨벡스 최적화 기법 기반의 믹서를 제시한다. 각 모터 및 프로펠러의 고장 영향성을 분석하기 위하여 컨벡스 함수 성질을 이용하여 가용 조종력 집합을 계산하였으며 이를 도시하는 방법을 기술하였다. 조종력 할당을 최적화 문제로 정의하고, 실시간으로 최적해를 구하기 위하여 컨벡스 함수로 문제를 재정의하였다. 컨벡스 최적화 솔버를 사용하여 수직 이착륙 비행 모드의 믹서를 구현하였으며 조종력 할당 기법들의 성능을 가용 조종력 범위 집합으로 비교하였다. 최종적으로 비선형 6자유도 시뮬레이션을 통하여 타기법(의사역행렬 기법, 재분배의사역행렬 기법)과 비교 분석하였다.

• 대한수학회보
• /
• 제60권4호
• /
• pp.905-913
• /
• 2023

Suppose that M is a strictly convex hypersurface in the (n + 1)-dimensional Euclidean space 𝔼ⁿ⁺¹ with the origin o in its convex side and with the outward unit normal N. For a fixed point p ∈ M and a positive constant t, we put 𝚽_t the hyperplane parallel to the tangent hyperplane 𝚽 at p and passing through the point q = p - tN(p). We consider the region cut from M by the parallel hyperplane 𝚽_t, and denote by I_p(t) the (n + 1)-dimensional volume of the convex hull of the region and the origin o. Then Schneider's characterization theorem for ellipsoids states that among centrally symmetric, strictly convex and closed surfaces in the 3-dimensional Euclidean space 𝔼³, the ellipsoids are the only ones satisfying I_p(t) = 𝜙(p)t, where 𝜙 is a function defined on M. Recently, the characterization theorem was extended to centrally symmetric, strictly convex and closed hypersurfaces in 𝔼ⁿ⁺¹ satisfying for a constant 𝛽, I_p(t) = 𝜙(p)t^𝛽. In this paper, we study the volume I_p(t) of a strictly convex and complete hypersurface in 𝔼ⁿ⁺¹ with the origin o in its convex side. As a result, first of all we extend the characterization theorem to strictly convex and closed (not necessarily centrally symmetric) hypersurfaces in 𝔼ⁿ⁺¹ satisfying I_p(t) = 𝜙(p)t^𝛽. After that we generalize the characterization theorem to strictly convex and complete (not necessarily closed) hypersurfaces in 𝔼ⁿ⁺¹ satisfying I_p(t) = 𝜙(p)t^𝛽.