• Korean Journal of Mathematics
• /
• 제30권3호
• /
• pp.475-489
• /
• 2022

This paper focuses on a robust semi-infinite interval-valued optimization problem with uncertain inequality constraints (RSIIVP). By employing the concept of LU-optimal solution and Extended Mangasarian-Fromovitz Constraint Qualification (EMFCQ), necessary optimality conditions are established for (RSIIVP) and then sufficient optimality conditions for (RSIIVP) are derived, by using the tools of convexity. Moreover, a Wolfe type dual problem for (RSIIVP) is formulated and usual duality results are discussed between the primal (RSIIVP) and its dual (RSIWD) problem. The presented results are demonstrated by non-trivial examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.627-634
• /
• 1989

A collision-free trajectory planning algorithm using the iterative learning concept is proposed for dual robot arms in a 3-D workspace to accurately follow their specified paths with constant velocities. Specifically, a collision-free trajectory minimizing the trajectory error is obtained first by employing the linear programming technique. Then the total operating time is iteratively adjusted based on the maximum trajectory error of the previous iteration so that the collision-free trajectory has no deviation from the specified path and also the operating time is near-minimal.

• 인터넷정보학회논문지
• /
• 제11권4호
• /
• pp.95-106
• /
• 2010

최근 복잡한 프로그래밍 환경에서 다수의 프로세스들은 서로 협력하기 위하여 서로 통신하고 자원과 정보를 공유한다. 커널에서는 이것이 가능한 방법으로 프로세스간 통신이라는 IPC(Inter-Process Communication)를 제공한다. 리눅스에서 사용되는 공유 메모리는 동일한 메모리 영역에 여러개의 프로세스가 접근할 수 있도록 해 주는 기술이다. 본 논문에서는 서로 다른 코어에 서로 다른 운영체제를 갖는 듀얼코어 임베디드 리눅스 시스템에서 공유 메모리 성능 개선 방안을 제시하고, MP2530F(ARM926F+ARM946E)의 임베디드 리눅스 시스템을 구축하여 성능을 측정한다. 공유 메모리를 이용한 프로세스의 동작이 별개의 CPU에서 동작되도록 함으로써 성능 향상을 꾀한다.

• Journal of applied mathematics & informatics
• /
• 제26권1_2호
• /
• pp.251-261
• /
• 2008

In this paper second order cone convex, second order cone pseudoconvex, second order strongly cone pseudoconvex and second order cone quasiconvex functions are introduced and their interrelations are discussed. Further a MondWeir Type second order dual is associated with the Vector Minimization Problem and the weak and strong duality theorems are established under these new generalized convexity assumptions.

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1285-1293
• /
• 2011

We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

• 대한수학회보
• /
• 제43권2호
• /
• pp.265-275
• /
• 2006

In this paper, we introduce a fractional domination game arising from fractional domination problems on graphs and focus on its balancedness and concavity. We first characterize the core of the fractional domination game and show that its core is always non-empty taking use of dual theory of linear programming. Furthermore we study concavity of this game.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.127-133
• /
• 2012

We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.728-731
• /
• 1999

This paper concerns a development of LQ-servo PI controller design on the basis of time-domain approach. This is because the previous design techniques developed on the frequency-domain is not well suited to meet the time-domain design specifications. Our development techniques used in this paper is based on the convex optimization methods including Lagrange multiplier, dual concept, semidefinite programming.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1381-1395
• /
• 2009

Mixed type second order dual to the non-differentiable problem containing support functions is formulated and duality theorems are proved under generalized second order convexity conditions. It is pointed out that the mixed type duality results already reported in the literature are the special cases of our results.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.211-218
• /
• 2003

Let H be a Hilbert space, X be a real Banach space, A : H \longrightarrow X be an operator with D(A) dense in H, G： H \longrightarrow H be positive definite, $\chi$ $\in$ D(A) and b $\in$ H. Consider the quadratic programming problem: QP： Minimize $\frac{1}{2}$〈p, $\chi$〉 + 〈$\chi$, G$\chi$〉 subject to A$\chi$= b In this paper, we obtain an explicit solution to the above problem using generalized inverses.