• 대한기계학회논문집A
• /
• 제29권1호
• /
• pp.45-52
• /
• 2005

A general approximate optimization technique by sequential design domain(SDD) did not save response values for getting an approximate function in each step. It has a disadvantage at aspect of an expense. In this paper, previous response values are recycled for constructing an approximate function. For this reason, approximation function is more accurate. Accordingly, even if we did not determine move limit, a system is converged to the optimal design. Size and shape optimization using approximate optimization technique is carried out with SDD. Algorithm executing Pro/Engineer and ANSYS are automatically adopted in the approximate optimization program by SDD. Convergence criterion is defined such that optimal point must be located within SDD during the three steps. The PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm is used to solve approximate optimization problems. This algorithm uses the second-order information in the direction finding problem and uses the active set strategy.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1239-1248
• /
• 2010

In this paper, an implementable BFGS bundle algorithm for solving a nonsmooth convex optimization problem is presented. The typical method minimizes an approximate Moreau-Yosida regularization using a BFGS algorithm with inexact function and the approximate gradient values which are generated by a finite inner bundle algorithm. The approximate subgradient of the objective function is used in the algorithm, which can make the algorithm easier to implement. The convergence property of the algorithm is proved under some additional assumptions.

• 한국자동차공학회논문집
• /
• 제14권6호
• /
• pp.57-65
• /
• 2006

An approximate function approach has been developed using the subsystem synthesis method for real-time multibody vehicle dynamics models. In this approach, instead of solving loop closure constraint equations of the suspension linkage, approximate functions are used. The approximate function represents the functional relationship between dependent coordinates and independent coordinates of the suspension subsystem. This kinematic relationship is also included in the suspension subsystem equations of motion. Different order of polynomial functions are tried to find out the best candidate functions. The proposed method is also compared with the conventional subsystem synthesis method to verify its efficiency and accuracy.

• Journal of applied mathematics & informatics
• /
• 제27권1_2호
• /
• pp.149-159
• /
• 2009

In this paper, we introduce some approximate optimal solutions and an augmented Lagrangian function in nonlinear programming, establish dual function and dual problem based on the augmented Lagrangian function, discuss the relationship between the approximate optimal solutions of augmented Lagrangian problem and that of primal problem, obtain approximate KKT necessary optimality condition of the augmented Lagrangian problem, prove that the approximate stationary points of augmented Lagrangian problem converge to that of the original problem. Our results improve and generalize some known results.

• 대한기계학회논문집A
• /
• 제29권6호
• /
• pp.842-851
• /
• 2005

In this paper, a new method for constrained optimization of noisy functions is proposed. In approximate optimization using response surface methods, if constraints have severe noise, the approximate feasible region defined by approximate constraints is apt to include some of the infeasible region defined by actual constraints. This can cause the approximate optimum to converge into the infeasible region. In the proposed method, the approximate optimization is performed with the approximate constraints shifted by their deviations, which are calculated using a diagonal quadratic response surface method. This can prevent the approximate optimum from converging into the infeasible region. To fit the objective and constraints into diagonal quadratic models, we select the center and 4 additional points along each axis of design variables as experimental points. The deviation of each function is calculated using the differences between the real and approximate function values at the experimental points. A sequential approximate optimization technique based on the trust region algorithm is adopted to manage approximate models. The proposed approach is validated by solving some design problems. The results of the problems show the effectiveness of the proposed method.

• 충청수학회지
• /
• 제29권4호
• /
• pp.631-642
• /
• 2016

This article deals with one-dimension backward heat conduction problem (BHCP). A new approach based on least squares support vector machines (LS-SVM) is proposed for obtaining their approximate solutions. The approximate solution is presented in closed form by means of LS-SVM, whose parameters are adjusted to minimize an appropriate error function. The approximate solution consists of two parts. The first part is a known function that satisfies initial and boundary conditions. The other is a product of two terms. One term is known function which has zero boundary and initial conditions, another term is unknown which is related to kernel functions. This method has been successfully tested on practical examples and has yielded higher accuracy and stable solutions.

• Journal of the Korean Data and Information Science Society
• /
• 제23권6호
• /
• pp.1213-1222
• /
• 2012

We shall derive the moment of the ratio Y/(X + Y) and the reliability P(X < Y ), and then observe the skewness of the ratio in a bivariate Pareto density function of (X, Y). And we shall consider an approximate MLE of parameters in the bivariate Pareto density function.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2007년도 정기 학술대회 논문집
• /
• pp.141-144
• /
• 2007

Given a number of training data, a traditional BPN is normally trained by minimizing the absolute difference between target outputs and approximate outputs. When BPN is used as a meta-model for inequality constraint function, approximate optimal solutions are sometimes actually infeasible in a case where they are active at the constraint boundary. The paper describes the development of the efficient BPN based meta-model that enhances the constraint feasibility of approximate optimal solution. The modified BPN based meta-model is obtained by including the decision condition between lower/upper bounds of a constraint and an approximate value. The proposed approach is verified through a simple mathematical function and a ten-bar planar truss problem.

• Structural Engineering and Mechanics
• /
• 제38권5호
• /
• pp.651-674
• /
• 2011

This paper presents a novel method for predicting the failure probability of structural or mechanical systems subjected to random loads and material properties involving multiple design points. The method involves Multicut High Dimensional Model Representation (Multicut-HDMR) technique in conjunction with moving least squares to approximate the original implicit limit state/performance function with an explicit function. Depending on the order chosen sometimes truncated Cut-HDMR expansion is unable to approximate the original implicit limit state/performance function when multiple design points exist on the limit state/performance function or when the problem domain is large. Multicut-HDMR addresses this problem by using multiple reference points to improve accuracy of the approximate limit state/performance function. Numerical examples show the accuracy and efficiency of the proposed approach in estimating the failure probability.

• Journal of the Korean Data and Information Science Society
• /
• 제17권3호
• /
• pp.905-912
• /
• 2006

Support vector classification(SVC) provides more complete description of the linear and nonlinear relationships between input vectors and classifiers. In this paper we propose to solve the optimization problem of SVC with a modified hinge loss function, which enables to use an iterative reweighted least squares(IRWLS) procedure. We also introduce the approximate cross validation function to select the hyperparameters which affect the performance of SVC. Experimental results are then presented which illustrate the performance of the proposed procedure for classification.