• 대한조선학회지
• /
• 제17권4호
• /
• pp.46-54
• /
• 1980

The ship structural design problem is formulated as a general nonlinear optimization problem with constraints. Characteristics of the general structural problems and various optimization techniques are discussed, with special emphasis on penalty function method for constrained problems. A simple example of the solution of a midship structure design of cargo vessel, which complies with the rules of the Korean Register of Shipping is shown using SUMT-exterior method with some search methods.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2007년도 추계학술대회논문집
• /
• pp.446-451
• /
• 2007

An Improved finite element model updating method to address the numerical difficulty associated with ill-conditioning and rank-deficiency. These difficulties frequently occur in model updating problems, when the identification of a larger number of physical parameters is attempted than that warranted by the information content of the experimental data. Based on the standard Bounded Variables Least-squares (BVLS) method, which incorporates the usual upper/lower-bound constraints, the proposed method is equipped with new constraints based on the correlation coefficients between the sensitivity vectors of updating parameters. The effectiveness of the proposed method is investigated through the numerical simulation of a simple framed structure by comparing the results of the proposed method with those obtained via pure BVLS and the regularization method. The comparison indicated that the proposed method and the regularization method yield approximate solutions with similar accuracy.

• 한국멀티미디어학회논문지
• /
• 제6권7호
• /
• pp.1200-1208
• /
• 2003

자바카드 기술은 스마트카드나 메모리 제한적인 장치에서 자바 프로그래밍 언어로 작성된 응용프로그램을 동작 가능하게 한다. 자바카드 기술은 높은 안전성, 이식성, 다중의 응용프로그램을 관리하고 저장하는 기능을 제공한다. 그러나 자바카드 플랫폼의 제한적인 메모리 자원은 다양한 용도로 자바카드가 보급되는데 저해 요인으로 작용하고 있다. 따라서 본 논문에서는 자바카드의 효율적인 메모리 사용을 위해서 바이트코드 최적화 알고리즘을 제안한다. 이 알고리즘은 예외처리 구문 try-catch-finally에서 catch절의 매개변수에 대한 기억장소를 공유하게 함으로써 생성되는 바이트코드의 크기를 줄일 수 있다.

• Journal of Advanced Marine Engineering and Technology
• /
• 제24권2호
• /
• pp.50-56
• /
• 2000

This paper presents the design of an optimal state feedback controller for container cranes under some design specifications. To do this, the nonlinear equation of a container crane system is linearized and then augmented to eliminate the steady-state error, and some constraints are derived from the design specifications. Designing the controller involves a constrained optimization problem which classical gradient-based methods have difficulties in handling. Therefore, a real-coding genetic algorithm incorporating the penalty strategy is used. The responses of the proposed control system are compared with those of the unconstrained optimal control system to illustrate the efficiency.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• pp.483-487
• /
• 1994

In this paper, we analize the effect of a steering water used in a unified phase I-phase II semi-infinite constrained optimization algorithm and present a new algorithm based on the facts that when the point x is far away from the feasible region where all the constraints are satisfied, reaching to the feasible region is more important than minimizing the cost function and that when the point x is near the region, it is more efficient to try to reach the feasible region and to minimize the cost function concurrently. Also, the angle between the search direction vector and the gradient of the cost function is considered when the steering parameter value is computed. Even though changing the steering parameter does not change the rate of convergence of the algorithm, we show through some examples that the proposed algorithm performs better than the other algorithms.

• 한국CDE학회논문집
• /
• 제4권2호
• /
• pp.127-138
• /
• 1999

For reverse engineering, curves and surfaces are modeled for new products by interpolating the digitized data points. But there are many measuring or deviation errors. Therefore, it is important to handle errors during the curve or surface modeling. If the errors are ignored, designer could get undesirable results. For this reason, fairing procedure with the aesthetics criteria is necessary in computer modeling. This paper presents methods of 3D NURBS curve fairing. The techniques are based on automatic repositioning of the digitized dat points or the NURBS curve control points by a constrained nonlinear optimization algorithm. The objective function is derived variously by derived curved. Constraints are distance measures between the original and the modified digitized data points. Changes I curve shape are analyzed by illustrations of curve shapes, and continuous plotting of curvature and torsion.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.123-136
• /
• 2004

In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.173-190
• /
• 2011

In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제9권1호
• /
• pp.80-89
• /
• 2014

A stochastic optimal power flow (S-OPF) model considering uncertainties of load and wind power is developed based on chance constrained programming (CCP). The difficulties in solving the model are the nonlinearity and probabilistic constraints. In this paper, a limit relaxation approach and an iterative learning control (ILC) method are implemented to solve the S-OPF model indirectly. The limit relaxation approach narrows the solution space by introducing regulatory factors, according to the relationship between the constraint equations and the optimization variables. The regulatory factors are designed by ILC method to ensure the optimality of final solution under a predefined confidence level. The optimization algorithm for S-OPF is completed based on the combination of limit relaxation and ILC and tested on the IEEE 14-bus system.

• 한국통신학회논문지
• /
• 제32권10A호
• /
• pp.1023-1033
• /
• 2007

This study considers a joint congestion control, routing and power control for energy-constrained wireless networks. A mathematical model is introduced which includes maximization of network utility, maximization of network lifetime, and trade-off between network utility and network lifetime. The framework would maximize the overall throughput of the network where the overall throughput depends on the data flow rates which in turn is dependent on the link capacities. The link capacity on the other hand is a function of transmit power levels and link Signal-to-Interference-plus-Noise-Ratio (SINR) which makes the power allocation problem inherently difficult to solve. Using dual decomposition techniques, subgradient method, and logarithmic transformations, a joint algorithm for rate and power allocation problems was formulated. Numerical examples for each optimization problem were also provided.