• Communications for Statistical Applications and Methods
• /
• v.29 no.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.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.14 no.3
• /
• pp.339-348
• /
• 2001

More often a commercial package for the structural analysis is necessary in the structural optimum design. In this case the task of combining the package with an optimization program must be required, hut it is not so simple because interchanging some data between them is difficult. Sequential approximate optimization is currently used as a natural way to overcome the hard task. If sequential approximate optimization has wide side constraints that the lower limit of design variables is very small and their upper limit is very large, it is not so easy to obtain approximated functions accurately for the whole design domain. This paper proposes a sequential design domain method, which is very useful to carry out sequential approximate optimization in this case. In this paper, the response surface methodology is used to obtain approximated functions and the orthogonal array is used for design of experiments. The sequential approximate optimization of 3-bar and 10-bar trusses is demonstrated to verify the reliability of the sequential design domain method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.9 s.240
• /
• pp.1199-1208
• /
• 2005

Nowadays, it is performed actively to optimize by using an approximate model. This is called the approximate optimization. In addition, the sequential approximate optimization (SAO) is the repetitive method to find an optimum by considering the convergence of an approximate optimum. In some recent studies, it is proposed to increase the fidelity of approximate models by applying the sequential sampling. However, because the accuracy and efficiency of an approximate model is directly connected with the design area and the termination criteria are not clear, sequential sampling method has the disadvantages that could support an unreasonable approximate optimum. In this study, the SAO is executed by using trust region, Kriging model and Optimal Latin Hypercube design (OLHD). Trust region is used to guarantee the convergence and Kriging model and OLHD are suitable for computer experiment. finally, this SAO method is applied to various optimization problems of highly nonlinear mathematical functions. As a result, each approximate optimum is acquired and the accuracy and efficiency of this method is verified by comparing with the result by established method.

• Journal of Mechanical Science and Technology
• /
• v.16 no.2
• /
• pp.203-210
• /
• 2002

For effective response surface modeling during sequential approximate optimization (SAO), the normalized and the augmented D-optimality criteria are presented. The normalized D-optimality criterion uses the normalized Fisher information matrix by its diagonal terms in order to obtain a balance among the linear-order and higher-order terms. Then, it is augmented to directly include other experimental designs or the pre-sampled designs. This augmentation enables the trust region managed sequential approximate optimization to directly use the pre-sampled designs in the overlapped trust regions in constructing the new response surface models. In order to show the effectiveness of the normalized and the augmented D-optimality criteria, following two comparisons are performed. First, the information surface of the normalized D-optimal design is compared with those of the original D-optimal design. Second, a trust-region managed sequential approximate optimizer having three D-optimal designs is developed and three design problems are solved. These comparisons show that the normalized D-optimal design gives more rotatable designs than the original D-optimal design, and the augmented D-optimal design can reduce the number of analyses by 30% - 40% than the original D-optimal design.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.116-122
• /
• 2023

Sentiment categorization technique be commonly isolated interested in threes significant classifications name Machine Learning Procedure (ML), Lexicon Based Method (LB) also finally, the Hybrid Method. In Machine Learning Methods (ML) utilizes phonetic highlights with apply notable ML algorithm. In this paper, in classification and identification be complete base under in optimizations technique called sequential minimal optimization with Random Forest algorithm (SMORF) for expanding the exhibition and proficiency of sentiment classification framework. The three existing classification algorithms are compared with proposed SMORF algorithm. Imitation result within experiential structure is Precisions (P), recalls (R), F-measures (F) and accuracy metric. The proposed sequential minimal optimization with Random Forest (SMORF) provides the great accuracy.

• East Asian mathematical journal
• /
• v.39 no.5
• /
• pp.505-514
• /
• 2023

In this paper, we consider a second-order cone linear fractional vector optimization problems (FVP), and obtain sequential optimality theorems for (FVP) which hold without any constraint qualification and which are expressed by sequences.

• Transactions of the Society of Information Storage Systems
• /
• v.3 no.4
• /
• pp.178-182
• /
• 2007

Topology optimization methods are classified into two methods such as the density method and the homogenization method. Those methods need to consider relationships between the material property and the density of each element in a design domain, the relaxation of the design space, etc. However, it is hard to apply on some cases due to the complexity to compose the design objective and its sensitivity analysis. In this paper, a modified topology optimization is proposed to assist designers who do not have mathematical or theoretical background of the topology optimization. In this study, optimal topology of structures can be achieved by the sequential design of experiment (DOE) and the sensitivity analysis. We conducted the DOE with an orthogonal array and the sensitivity analysis of design variables to determine sensitive variables used for connectivity between elements. The modified topology optimization method has advantages such as freedom from penalizing intermediate values and easy application with basic DOE concept.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.1 s.232
• /
• 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.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.16 no.12
• /
• pp.1156-1166
• /
• 2004

The shape of plate-fin type heat sink is numerically optimized to acquire the minimum pressure drop under the required temperature rise. In constrained nonlinear optimization problems of thermal/fluid systems, three fundamental difficulties such as high computational cost for function evaluations (i.e., pressure drop and thermal resistance), the absence of design sensitivity information, and the occurrence of numerical noise are commonly confronted. Thus, a sequential approximate optimization (SAO) algorithm has been introduced because it is very hard to obtain the optimal solutions of fluid/thermal systems by means of gradient-based optimization techniques. In this study, the progressive quadratic response surface method (PQRSM) based on the trust region algorithm, which is one of sequential approximate optimization algorithms, is used for optimization and the heat sink is optimized by combining it with the computational fluid dynamics (CFD).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.1
• /
• pp.159-166
• /
• 2019

Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.