• Journal of the Korean Society of Industry Convergence
• /
• v.5 no.3
• /
• pp.261-268
• /
• 2002

In this paper, the shape optimization is considered over the upper slab of reinforced concrete culvert. The sequential linear programming method (SLP) is used as a rational approach to this shape optimization. To make a comparison between the arch shaped member and the straight member for the upper slab, the culverts with 5~20m earth height were adopted. It is shown that the optimum rise/span is about 7%-13%, and the arch shaped member is more cheap (over 10%) than the straight member for the construction cost.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.101-114
• /
• 1996

This study suggests an accelerated genetic algorithm for the vehicle routing problem (AGAVRP). This algorithm treats both the single-visit and the multiple-visit models. AGAVRP is accelerated by the OR techniques at the various stages of the algorithm. In order to improve the convergence of AGAVRP, a robust set of parameters is determined by the experimental design approach. The relative performance of AGAVRP is comparable to the other known algorithms. The advantage of the proposed algorithm is flexibility and better convergence.

• Korean Journal of Mathematics
• /
• v.20 no.1
• /
• pp.117-123
• /
• 2012

We provide a convergence analysis of Newton's method for set valued maps under center H$\ddot{o}$lder continuity conditions on the Fr$\acute{e}$chet derivative of the operator involved. This approach extends the applicability of earlier works [4,5,7].

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.495-501
• /
• 1996

There is currently a regain of interest in ADI (Alternating Direction Implicit) method as a preconditioner for iterative Method for solving large sparse linear systems, because of its suitability for parallel computation. However the classical ADI is not applicable to FE(Finite Element) matrices. In this paper wer propose a Block-ADI method, which is applicable to Finite Element metrices. The new approach is a combination of classical ADI method and domain decompositi on. Also, we provide a partial proof of the convergence based on the results from the regular splittings, in case the discretization metrix is symmetric positive definite.

• Communications of the Korean Mathematical Society
• /
• v.25 no.2
• /
• pp.313-325
• /
• 2010

General models for the relaxed proximal point algorithm using the notion of relative maximal accretiveness (RMA) are developed, and then the convergence analysis for these models in the context of solving a general class of nonlinear inclusion problems differs significantly than that of Rockafellar (1976), where the local Lipschitz continuity at zero is adopted instead. Moreover, our approach not only generalizes convergence results to real Banach space settings, but also provides a suitable alternative to other problems arising from other related fields.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.277-282
• /
• 1994

Convergence of the state error e to zero in adaptive systems is shown using the uniqueness of solutions and the existence of a Lyapunov function in which the adaptation laws are constructed. Results in the paper are general, and therefore applicable to any adaptive control of a linear/nonlinear, time-varying or distributed-parameter system. Since the approach taken in the paper does not require the boundedness of the derivative of the state error e for all t .geq. 0, it is particularly useful in the adaptive control of infinite dimensional systems.

• Proceedings of the CALSEC Conference
• /
• 2004.02a
• /
• pp.89-97
• /
• 2004

1. Introduction; Fundamental Difference between conventional old commerce and e-commerce？ 2. "Quantity changes into Quality"; Phase transition and Critical phenomena Logarithmic Convergence and Emergence of Quality 3. Networked Small World; Indications from Genomics; Power-Law Ordered Plain Structure of Super-Complex System ⇔ The Structure of e-Biz. 4. Uniquitous Crisis to Ubiquitous Critical Points for the Emergence of Qualified Business with e-strucrure

• Journal of the Korean Society of Industry Convergence
• /
• v.7 no.2
• /
• pp.181-186
• /
• 2004

This study presents a optimization of structure, in which constraints contain the conditions of stress and serviceability, while the sequential linear programming method (SLP) is used as a rational approach. The optimum design results contained on the limit state constraints are compared with those obtained by the only stress and ministry of construction enacted standard plans. A simple slab bridge is analysed numerically for illustration of the structural optimization. It may be asserted that serviceability constraints is very important to a structure design.

• Journal of the Korean Society of Industry Convergence
• /
• v.6 no.2
• /
• pp.95-102
• /
• 2003

In this paper, optimum design is considered over the retaining wall with seismic constraints. The sequential linear programming method(SLP) is used as a rational approach to this optimum design. To make a comparison between the seismic design and the normal design, retaining wall with 4~7m height were adopted. It is shown that the seismic design is more expensive (over 30%) than the normal design for the construction cost.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.155-161
• /
• 2006

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.