• 대한수학회보
• /
• 제48권4호
• /
• pp.697-704
• /
• 2011

By using the method of differential subordinations, we derive some sufficient conditions for strongly starlike functions associated with a linear operator. All these results presented here are sharp.

• East Asian mathematical journal
• /
• 제29권3호
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

• 호남수학학술지
• /
• 제35권2호
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 춘계학술대회 논문집
• /
• pp.141-146
• /
• 1999

A new method, so called MMA(Method of Moving Asymptotes) was applied to the optimization problems of non-linear functions and non-linear structures. In each step of the iterative process, tile MMA generates a strictly convex approximation subproblems and solves them by using the dual problems. The generation of these subproblems is controlled by so called 'moving asymptotes', which may both make no oscillation and speed up tile convergence rate of optimization process. By contrast in generalized dual function, the generated function by MMA is always explicit type. Both the objective and behaviour constraints which were approximated are optimized by dual function. As the results of some examples, it was found that this method is very effective to obtain the global solution for problems with many local solutions. Also it was found that MMA is a very effective approximate method using the original function and its 1st derivatives.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.33.1-33
• /
• 2001

We address a novel approach to identify a nonlinear dynamic system for Wiener models, which are composed of a linear dynamic system part followed by a nonlinear static part. The aim of system identification here is to provide the optimal mathematical model of both the linear dynamic and the nonlinear static parts in some appropriate sense. Assuming the nonlinear static part is invertible, we approximate the inverse function by a piecewise linear function. We estimate the piecewise linear inverse function by using the evolutionary computation approach such as genetic algorithm (GA) and evolution strategies (ES), while we estimate the linear dynamic system part by the least squares method. The results of numerical simulation studies indicate the usefulness of proposed approach to the Wiener model identification.

• 한국전산유체공학회지
• /
• 제3권2호
• /
• pp.1-8
• /
• 1998

We make use of cubic B-spline interpolation function in two cases: heat conduction and fluid flow problems. Cubic B-spline test function is employed because it is superior to approximation of linear and non-linear problems. We investigated the accuracy of the numerical formulation and focused on the position of the breakpoints within the computational domain. When the domain is divided by partitions of equal space, the results show poor accuracy. For the case of a heat conduction problem this partition can not reflect the temperature gradient which is rapidly changed near the wall. To correct the problem, we have more grid points near the wall or the region which has a rapid change of variables. When we applied the unequally spaced breakpoints, the results show high accuracy. Based on the comparison of the linear problem, we extended to the highly non-linear fluid flow problems.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권5호
• /
• pp.580-585
• /
• 1999

This paper deals with the stability of discrete time linear systems with time varying delays in state. In this paper, the magnitude of time-varying delays is assumed to be upper-bouded. The stability of discrete time linear systems with time-varying delays in state is related with the stability of discrete time linear systems with constant time delay in state. To show this, a new Lyapunov function is proposed. Using this Lyapunov function, a sufficient condition for the asymptotic stability is derived.

• 대한산업공학회지
• /
• 제26권3호
• /
• pp.220-226
• /
• 2000

The problem (P) of optimizing a linear function $d^Tx$ over the set of efficient points for a multiple objective linear program (M) is difficult because the efficient set is nonconvex. There are some interesting properties between the objective linear vector d and the matrix of multiple objectives C and those properties lead us to establish criteria to solve (P) with a linear program. In this paper we investigate a system of the linear equations $C^T{\alpha}$ = d and construct two linearly independent positive vectors u, v such that ${\alpha}$ = u - v. From those vectors u, v, solving an weighted sum linear program for finding an efficient extreme point for the (M) is a way of getting an optimal solution of the problem (P). Therefore the theorems presented in this paper provided us an easy way of solving nonconvex program (P) with a weighted sum linear program.

• 제어로봇시스템학회논문지
• /
• 제6권5호
• /
• pp.339-344
• /
• 2000

This paper is concerned with the simplification of complex linear time-invariant systems. A simple technique is suggested using the well-known least squares method in the frequency domain. Given a high-order transfer function in the s- or z-domain, the squared-gain function corresponding to a low-order model is computed by the least squares method. Then, the low-order transfer function is obtained through the factorization. Three examples are given to illustrate the efficiency of the proposed method.

• 대한수학교육학회지:학교수학
• /
• 제8권3호
• /
• pp.265-290
• /
• 2006

본 연구의 목적은 엑셀의 활용이 일차함수의 문제해결에 어떤 영향을 미치는가를 알아보는데 있다. 엑셀을 활용한 교수실험 전과 후에 학생들의 함수에 관한 문제해결에서의 변화를 알아보기 위해 사전 사후 문제해결검사를 실시하였다. 문제해결검사 분석은 정확한 과정-대상관점, 근접한 과정-대상관점, 부정확한 과정-대상관점으로 범주화해 이루어졌다. 문제해결검사 분석 결과, 교수실험에 참여한 학생들 모두 일차함수에 관한 문제해결관점이 바람직한 방향으로 변화되었다. 엑셀을 활용한 탐구학습환경이 지필환경의 제한점을 보완할 수 있다는 시사점을 도출하였다.