• 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.

• Communications of the Korean Mathematical Society
• /
• v.28 no.3
• /
• pp.597-602
• /
• 2013

In this paper, Mond-Weir type duality results for a uncertain multiobjective robust optimization problem are given under generalized invexity assumptions. Also, weak vector saddle-point theorems are obtained under convexity assumptions.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1527-1534
• /
• 2010

In this paper, we consider nonsmooth optimization problem of which objective and constraint functions are locally Lipschitz. We establish sufficient optimality conditions and duality results for nonsmooth vector optimization problem given under nearly strict invexity and near invexity-infineness assumptions.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.247-253
• /
• 2011

A sustainability of electricity supply has emerged as a critical issue for low carbon green growth in South Korea. Wind power is the fastest growing source of renewable energy. However, due to its own intermittency and volatility, the power supply generated from wind energy has variability in nature. Hence, accurate forecasting of wind speed and power plays a key role in the effective harvesting of wind energy and the integration of wind power into the current electric power grid. This paper presents a short-term wind speed prediction method based on support vector regression. Moreover, particle swarm optimization is adopted to find an optimum setting of hyper-parameters in support vector regression. An illustration is given by real-world data and the effect of model regularization by particle swarm optimization is discussed as well.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.971-985
• /
• 2007

A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and ${\epsilon}$-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we present a proposition with a sufficient condition for an efficient solution to be properly efficient, which are a generalization of the well-known Isermann result for a linear vector optimization problem. An example is given to illustrate the significance of our main results. Also, we give an example showing that the proper efficiency may not imply certain closeness assumption.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.8
• /
• pp.1071-1079
• /
• 2018

In this study, the design methodology as well as network architecture of Support Vector Machine based Polynomial Neural Network, which is a kind of the dynamically generated neural networks, is introduced. The Support Vector Machine based polynomial neural networks is given as a novel network architecture redesigned with the aid of polynomial neural networks and Support Vector Machine. The generic polynomial neural networks, whose nodes are made of polynomials, are dynamically generated in each layer-wise. The individual nodes of the support vector machine based polynomial neural networks is constructed as a support vector machine, and the nodes as well as layers of the support vector machine based polynomial neural networks are dynamically generated as like the generation process of the generic polynomial neural networks. Support vector machine is well known as a sort of robust pattern classifiers. In addition, in order to enhance the structural flexibility as well as the classification performance of the proposed classifier, multi-objective particle swarm optimization is used. In other words, the optimization algorithm leads to sequentially successive generation of each layer of support vector based polynomial neural networks. The bench mark data sets are used to demonstrate the pattern classification performance of the proposed classifiers through the comparison of the generalization ability of the proposed classifier with some already studied classifiers.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.7
• /
• pp.601-608
• /
• 2015

The static aeroelastic analysis and optimization of flexible wings are conducted for steady state conditions while both aerodynamic and structural parameters can be used as optimization variables. The system of multidisciplinary design optimization as a robust methodology to couple commercial codes for a static aeroelastic optimization purpose to yield a convenient adaptation to engineering applications is developed. Aspect ratio, taper ratio, sweepback angle are chosen as optimization variables and the skin thickness of the wing. The real-coded adaptive range multi-objective genetic algorithm code, which represents the global multi-objective optimization algorithm, was used to control the optimization process. The support vector regression(SVR) is applied for optimization, in order to reduce the time of computation. For this multi-objective design optimization problem, numerical results show that several useful Pareto optimal designs exist for the flexible wing.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.263-272
• /
• 2024

A model based on genetic algorithm optimization, GA-SVM, is proposed to warn university students of their status. This model improves the predictive effect of support vector machines. The genetic optimization algorithm is used to train the hyperparameters and adjust the kernel parameters, kernel penalty factor C, and gamma to optimize the support vector machine model, which can rapidly achieve convergence to obtain the optimal solution. The experimental model was trained on open-source datasets and validated through comparisons with random forest, backpropagation neural network, and GA-SVM models. The test results show that the genetic algorithm-optimized radial basis kernel support vector machine model GA-SVM can obtain higher accuracy rates when used for early warning in university learning.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.116-126
• /
• 2019

In this paper, an improved one-against-one support vector machine algorithm is used to classify multiple power quality disturbances. To solve the problem of parameter selection, an improved particle swarm optimization algorithm is proposed to optimize the parameters of the support vector machine. By proposing a new inertia weight expression, the particle swarm optimization algorithm can effectively conduct a global search at the outset and effectively search locally later in a study, which improves the overall classification accuracy. The experimental results show that the improved particle swarm optimization method is more accurate than a grid search algorithm optimization and other improved particle swarm optimizations with regard to its classification of multiple power quality disturbances. Furthermore, the number of support vectors is reduced.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.19 no.5
• /
• pp.589-595
• /
• 2010

This paper presents a reliability-based shape optimization (RBSO) using the evolutionary structural optimization (ESO). An actual design involves uncertain conditions such as material property, operational load, poisson's ratio and dimensional variation. The deterministic optimization (DO) is obtained without considering of uncertainties related to the uncertainty parameters. However, the RBSO can consider the uncertainty variables because it has the probabilistic constraints. In order to determine whether the probabilistic constraint is satisfied or not, simulation techniques and approximation methods are developed. In this paper, the reliability-based shape design optimization method is proposed by utilization the reliability index approach (RIA), performance measure approach (PMA), single-loop single-vector (SLSV), adaptive-loop (ADL) are adopted to evaluate the probabilistic constraint. In order to apply the ESO method to the RBSO, a sensitivity number is defined as the change of strain energy in the displacement constraint. Numerical examples are presented to compare the DO with the RBSO. The results of design example show that the RBSO model is more reliable than deterministic optimization.