• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.11
• /
• pp.1059-1068
• /
• 2007

Nonlinear response structural optimization is performed using equivalent loads (NROEL). Nonlinear response optimization is extremely cost because many nonlinear analyses are required. In NROEL, the external loads are transformed to the equivalent loads (EL) for linear static analysis and linear response optimization is carried out based on the EL in a cyclic manner until the convergence criteria are satisfied. EL is the load set which generates the same response field of linear analysis as that of nonlinear analysis. The primitive from of theory has been published. In this research, the theory is investigated with large scale example problems. Four examples are solved by using NROEL. Conventional optimization with sensitivity analysis using the finite difference method (FDM) is also applied to the same examples. Moreover, response surface optimization method is applied to the last two examples. The results of the optimizations are compared. In nonlinear response optimization of large scale problems, hundreds (or even thousands) of nonlinear analyses are expected to satisfy the convergence criteria. However, in nonlinear response optimization using equivalent loads, only tens of nonlinear analyses are required. The results are discussed and the usefulness of NROEL is presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.587-591
• /
• 2003

This study develops a neural network for solving optimization problems. Hopfield network has been used for such problems, but it frequently gives abnormal solutions or non-optimal solutions. Moreover, it takes much time for solving a solution. To overcome such disadvantages, this study adopts a neural network whose output nodes change with a small value at every evolution, and the proposed neural network is applied to solve ALB (Assembly Line Balancing) problems . Given a precedence diagram and a required number of workstations, an ALB problem is solved while achieving even distribution of workload among workstations. Here, the workload variance is used as the index of workload deviation, and is reflected to an energy function. The simulation results show that the proposed neural network yields good results for solving ALB problems with high success rate and fast execution time.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.7 s.238
• /
• pp.990-997
• /
• 2005

The objective of this paper is to present the element connectivity parameterization (ECP) fur three dimensional problems. In the ECP method, a continuum structure is viewed as discretized finite elements connected by zero-length elastic links whose stiffness values control the degree of inter-element connectivity. The ECP method can effectively avoid the formation of the low-density unstable elements. These elements appear when the standard element density method is used for geometrical nonlinear problems. In this paper, this ECP method developed fur two-dimensional problems is expanded to the design of three-dimensional geometrical nonlinear structures. Among others, the automatic procedure converting standard finite element models to the models suitable for the ECP approach is developed and applied for optimization problems defined on general three-dimensional design domains.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.121-128
• /
• 2009

In this paper, we describe a fixed-threshold sequential minimal optimization (FSMO) for structured SVM problems. FSMO is conceptually simple, easy to implement, and faster than the standard support vector machine (SVM) training algorithms for structured SVM problems. Because FSMO uses the fact that the formulation of structured SVM has no bias (that is, the threshold b is fixed at zero), FSMO breaks down the quadratic programming (QP) problems of structured SVM into a series of smallest QP problems, each involving only one variable. By involving only one variable, FSMO is advantageous in that each QP sub-problem does not need subset selection. For the various test sets, FSMO is as accurate as an existing structured SVM implementation (SVM-Struct) but is much faster on large data sets. The training time of FSMO empirically scales between O(n) and O($n^{1.2}$), while SVM-Struct scales between O($n^{1.5}$) and O($n^{1.8}$).

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.215-221
• /
• 1997

A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.175-178
• /
• 2003

In recent years, several researchers have presented the extensive research reports on network optimization problems. In our real life applications, many important network problems are typically formulated as a Maximum flow model (MXF) or a Minimum Cost flow model (MCF). In this paper, we propose a Genetic Algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including MXF and MCF models(MXF/MCF).

• Communications of the Korean Mathematical Society
• /
• v.13 no.1
• /
• pp.195-209
• /
• 1998

In this paper we present a new iteration method for solving optimization problems governed by partial differential equations. We generalize the existing methods such as simple gradient methods and pseudo-time methods to get an efficient iteration method. Numerical tests show that the convergence of the new iteration method is much faster than those of the pseudo-time methods especially when the parameter $\sigma$ in the cost functional is small.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.777-786
• /
• 2013

The purpose of this paper is to establish some relationships between proper efficiency of set-valued optimization problems and proper efficiency of vector variational-like inequalities under the assumptions of generalized cone-preinvexity. Our results extend and improve the corresponding results in the literature.

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

Conventional methods to solve the nonlinear programming problem range from augmented Lagrangian methods to sequential quadratic programming (SQP) methods. NPSOL, which is a SQP code, has been widely used to solve various optimization problems but is still subject to many numerical problems such as convergence to local optima, difficulties in initialization and in handling non-smooth cost functions. Recently, many evolutionary methods have been developed for constrained optimization. Among them, CEALM (Co-Evolutionary Augmented Lagrangian Method) shows excellent performance in the following aspects: global optimization capability, low sensitivity to the initial parameter guessing, and excellent constraint handling capability due to the benefit of the augmented Lagrangian function. This algorithm is ...

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.165-177
• /
• 2005

In this paper, an adaptive trust region method based on the conic model for unconstrained optimization problems is proposed and analyzed. We establish the global and super linear convergence results of the method. Numerical tests are reported that confirm the efficiency of the new method.