• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2001년도 춘계 학술대회논문집
• /
• pp.72-77
• /
• 2001

The computational efficiency of an shape optimization procedure is highly dependent upon the proper selection of shape representation methods and design variables. In this study, shape functions, Bezier and NURBS(non-uniform rational B-splines) curves are selected as configuration generation methods and their efficiencies on the nose shape design of high-speed air vehicles, are compared. The effects of the number of control points, weighting factors and the optimization methods when utilizing the NURBS curves, are investigated. By implementing Bezier and NURBS curves, shapes having lower drag than the optimization case utilizing the shape functions, were obtained, hence it was demonstrated that these curves have better capability in representing the configuration. Efforts will be given to improve the convergence behavior when utilizing the NURBS, hence to reduce the number of Navier-Stokes analysis calculations.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2005년도 추계 학술대회논문집
• /
• pp.99-104
• /
• 2005

For the efficient reliability analysis, Bi-direction two-point approximation(BTPA) method is developed which solves shortcomings of conventional two-point approximation(TPA) methods that generate an approximate surface with low accuracy or sometimes do an unstable approximate surface. The conventional reliability based design optimization(RBDO) methods require high computational cost compared with the deterministic design optimization(DO) methods. To overcome the computational inefficiency of RBDO, the approximate reliability analysis approaches on the TPA surface are proposed. Using these FORM and SORM analysis strategies, multi-point aerodynamic-structure interacted shape design optimizations with uncertainty are performed very efficiently.

• Journal of Mechanical Science and Technology
• /
• 제15권8호
• /
• pp.1132-1142
• /
• 2001

The paper describes the construction of global function approximation models for use in design optimization via global search techniques such as genetic algorithms. Two different approximation methods referred to as evolutionary fuzzy modeling (EFM) and neuro-fuzzy modeling (NFM) are implemented in the context of global approximate optimization. EFM and NFM are based on soft computing paradigms utilizing fuzzy systems, neural networks and evolutionary computing techniques. Such approximation methods may have their promising characteristics in a case where the training data is not sufficiently provided or uncertain information may be included in design process. Fuzzy inference system is the central system for of identifying the input/output relationship in both methods. The paper introduces the general procedures including fuzzy rule generation, membership function selection and inference process for EFM and NFM, and presents their generalization capabilities in terms of a number of fuzzy rules and training data with application to a three-bar truss optimization.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.269-279
• /
• 2007

This paper describes a direct search method for a class of linearly constrained optimization problem. Through research we find it can be treated as an unconstrained optimization problem. And with the decrease of dimension of the variables need to be computed in the algorithms, the implementation of convergence to KKT points will be simplified to some extent. Convergence is shown under mild conditions which allow successive frames to be rotated, translated, and scaled relative to one another.

• Communications for Statistical Applications and Methods
• /
• 제29권6호
• /
• pp.721-733
• /
• 2022

In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.

• International Journal of Quality Innovation
• /
• 제5권1호
• /
• pp.43-51
• /
• 2004

During process design or process optimization, it is quite common for experimenters to find optimum operating conditions for several responses simultaneously. The traditional multiresponse surfaces optimization methods do not consider the uncertain relationship among these responses sufficiently. For this reason, the authors propose an optimization method based on evidential reasoning theory by Dempster and Shafer. By maximizing the basic probability assignment function, which indicates the degree of belief that certain operating condition is the solution of this multiresponse surfaces optimization problem, the desirable operating condition can be found.

• Structural Engineering and Mechanics
• /
• 제47권2호
• /
• pp.209-225
• /
• 2013

A procedure employing a Teaching-Learning Based Optimization (TLBO) method is developed to design discrete pin jointed structures. TLBO process consists of two parts: the first part represents learning from teacher and the second part illustrates learning by interaction among the learners. The results are compared with those obtained using other various evolutionary optimization methods considering the best solution, average solution, and computational effort. Consequently, the TLBO algorithm works effectively and demonstrates remarkable performance for the optimization of engineering design applications.

• International Journal of Computer Science & Network Security
• /
• 제21권6호
• /
• pp.200-206
• /
• 2021

Fraud in e-commerce transaction increased in the last decade especially with the increasing number of online stores and the lockdown that forced more people to pay for services and groceries online using their credit card. Several machine learning methods were proposed to detect fraudulent transaction. Neural networks showed promising results, but it has some few drawbacks that can be overcome using optimization methods. There are two categories of learning optimization methods, first-order methods which utilizes gradient information to construct the next training iteration whereas, and second-order methods which derivatives use Hessian to calculate the iteration based on the optimization trajectory. There also some training refinements procedures that aims to potentially enhance the original accuracy while possibly reduce the model size. This paper investigate the performance of several NN models in detecting fraud in e-commerce transaction. The backpropagation model which is classified as first learning algorithm achieved the best accuracy 96% among all the models.

• 대한수학회지
• /
• 제61권2호
• /
• pp.395-408
• /
• 2024

There have been numerous studies on the characteristics of the solutions of ordinary differential equations for optimization methods, including gradient descent methods and alternating direction methods of multipliers. To investigate computer simulation of ODE solutions, we need to trace pseudo-orbits by real orbits and it is called shadowing property in dynamics. In this paper, we demonstrate that the flow induced by the alternating direction methods of multipliers (ADMM) for a C² strongly convex objective function has the eventual shadowing property. For the converse, we partially answer that convexity with the eventual shadowing property guarantees a unique minimizer. In contrast, we show that the flow generated by a second-order ODE, which is related to the accelerated version of ADMM, does not have the eventual shadowing property.

• Journal of Power Electronics
• /
• 제3권2호
• /
• pp.69-80
• /
• 2003

Computer aided engineering (CAE) is a systematic approach to develop a better product/application with maximum possible options and minimum transition time. This paper presents a comprehensive feasibility analysis of various CAE techniques for evaluation and optimization of power electronic converters and systems. Different CAE methods for analysis, design, and performance improvement are classified. In addition, their advantages compared to the conventional workbench experimental methods are explained in detail and through examples.