• 전기의세계
• /
• v.21 no.3
• /
• pp.48-52
• /
• 1972

The application of pontryagin's Maximum Principle to the optimal control eventually leads to the problem of solving the two point boundary value problem. Most of problems have been related to their own special factors, therfore it is very hard to recommend the best method of deriving their optimal solution among various methods, such as iterative Runge Kutta, analog computer, gradient method, finite difference and successive approximation by piece-wise linearization. The gradient method has been applied to the optimal control of two point boundary value problem in the power systems. The most important thing is to set up some objective function of which the initial value is the function of terminal point. The next procedure is to find out any global minimum value from the objective function which is approaching the zero by means of gradient projection. The algorithm required for this approach in the relevant differential equations by use of the Runge Kutta Method for the computation has been established. The usefulness of this approach is also verified by solving some examples in the paper.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1137-1144
• /
• 2003

The existing Function Point method to estimate the software size has been utilized frequently with the management information system. Due to the expanding usage of the real-time and embedded system, the Full Function Point method is being proposed. However, despite many research is being carried out relation to the software size, the research on the model to estimate the development cost from the measured software size is inadequate. This paper analyzed the linear regression model and power regression model which estimate the development cost from the software FFP The power model is selected, which shows its estimation is most adequate.

• The Journal of Society for e-Business Studies
• /
• v.14 no.3
• /
• pp.153-168
• /
• 2009

Many companies and governments perform information technology (IT) projections repeatedly for higher competitiveness and efficiency. Moreover, as the sizes of IT projects increase, the manpower and cost estimation of the projects are getting more important. In this research, we present a size estimation method of information system development projects on the basis of the function point method at the stage of information strategy planning(ISP), and illustrate the size calculation of an example IT project. According to the method, we first identify the types of projects, the scope and boundaries of size estimation, then count data and transaction functions from the artifacts of the ISP project. The unadjusted function points are adjusted to function point by the table of the Early Function Point. The way of calculating the sizes of IT projects will support successful IT projects by estimating reasonable manpower and cost for the projects.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.14 no.2
• /
• pp.93-111
• /
• 2010

The purpose of this paper is to obtain new complexity results for a second-order cone optimization (SOCO) problem. We define a proximity function for the SOCO by a kernel function. Furthermore we formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SOCO by using the proximity function and give its complexity analysis, and then we show that the new worst-case iteration bound for the IPM is $O(q\sqrt{N}(logN)^{\frac{q+1}{q}}log{\frac{N}{\epsilon})$, where $q{\geqq}1$.

• Journal of Advanced Marine Engineering and Technology
• /
• v.28 no.5
• /
• pp.801-810
• /
• 2004

The Primal-Dual Interior-Point (PDIP) method is currently one of the fastest emerging topics in optimization. This method has become an effective solution algorithm for large scale nonlinear optimization problems. such as the electric Optimal Power Flow (OPF) and natural gas and electricity OPF. This study describes major theoretical developments of the PDIP method as well as practical issues related to implementation of the method. A simple quadratic problem with linear equality and inequality constraints

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.167.5-167
• /
• 2001

Single point attitude determination method provides an optimal attitude minimizing the Wahba loss function. However, for the insufficient number of measurement vectors, the conventional single point methods has no unique solution. Thus, we introduce the sequential method to and an optimal attitude minimizing the windowed loss function. In this paper, this function is de ned as the sum of square errors for all measurement vectors within the axed sliding window. For simple implementation, the proposed algorithm is rewritten as a recursive form. Moreover, the covariance matrix is derived and expressed as a recursive form. Finally, we apply this algorithm to the attitude determination system with three LOS measurement sensors.

• Structural Engineering and Mechanics
• /
• v.14 no.6
• /
• pp.713-732
• /
• 2002

A local radial point interpolation method (LRPIM) based on local residual formulation is presented and applied to solid mechanics in this paper. In LRPIM, the trial function is constructed by the radial point interpolation method (PIM) and establishes discrete equations through a local residual formulation, which can be carried out nodes by nodes. Therefore, element connectivity for trial function and background mesh for integration is not necessary. Radial PIM is used for interpolation so that singularity in polynomial PIM may be avoided. Essential boundary conditions can be imposed by a straightforward and effective manner due to its Delta properties. Moreover, the approximation quality of the radial PIM is evaluated by the surface fitting of given functions. Numerical performance for this LRPIM method is further studied through several numerical examples of solid mechanics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.11
• /
• pp.879-885
• /
• 1990

An intergral equation is derived for surface current distribution of cylinders with end cap using quasistatic approximation method. The moment method is applied for numerical solution. Point matching method using Cubic B-spline function as a basis function, delta function as a weighting function is applied for moment method. And also, the influencial relation in accordance with structural variation is analized in case of spheroidal end up cap type and flat type.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.8
• /
• pp.846-855
• /
• 1992

In this paper, the decrease multipoint search method and Its learning algorithm for optimum value computatlon method of object function Is proposed. Using this method, the number of evaluation point according to searching time can t)e reduced multipoint of the direct search method by applying the unlivarlate method. And the learning algorithm can reprat the same search method in a new established boundary by using the searched result. In order to Investigate the efficience of algorithm, this method this method is applied to Rosenbrock and Powell, Colvelle function that are Impossible or uncertain in traditional direct search method. And the result of application, the optimum value searching oil every function Is successful. Especially, the algorithm is certified as a good calculation method for producing global(absolute) optimum value.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.4
• /
• pp.749-759
• /
• 2012

A globally convergent algorithm for solving equilibrium problems is proposed. The algorithm is based on a proximal point algorithm (shortly (PPA)) with a positive definite matrix M which is not necessarily symmetric. The proximal function in existing (PPA) usually is the gradient of a quadratic function, namely, ${\nabla}({\parallel}x{\parallel}^2_M)$. This leads to a proximal point-type algorithm. We first solve pseudomonotone equilibrium problems without Lipschitzian assumption and prove the convergence of algorithms. Next, we couple this technique with the Banach contraction method for multivalued variational inequalities. Finally some computational results are given.