• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.313-321
• /
• 2004

In this paper we study the problem of three-dimensional layout optimization on the simplified rotating vessel of satellite. The layout optimization model with behavioral constraints is established and some effective and convenient conditions of performance optimization are presented. Moreover, we prove that the performance objective function is locally Lipschitz continuous and the results on the relations between the local optimal solution and the global optimal solution are derived.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.1
• /
• pp.137-143
• /
• 2019

As the performance of computers increases, the use of deep learning, which has faced technical limitations in the past, is becoming more diverse. In many fields, deep learning has contributed to the creation of added value and used on the bases of more data as the application become more divers. The process for obtaining a better performance model will require a longer time than before, and therefore it will be necessary to find an optimal model that shows the best performance more quickly. In the artificial neural network modeling a tuning process that changes various elements of the neural network model is used to improve the model performance. Except Gride Search and Manual Search, which are widely used as tuning methods, most methodologies have been developed focusing on heuristic algorithms. The heuristic algorithm can get the results in a short time, but the results are likely to be the local optimal solution. Obtaining a global optimal solution eliminates the possibility of a local optimal solution. Although the Brute Force Method is commonly used to find the global optimal solution, it is not applicable because of an infinite number of hyper parameter combinations. In this paper, we use a statistical technique to reduce the number of possible cases, so that we can find the global optimal solution.

• East Asian mathematical journal
• /
• v.35 no.5
• /
• pp.535-545
• /
• 2019

This paper is concerned with the optimal control problem associated to strong solution of Belousov-Zhabotinskii reaction model in 2D domain. That is, we otain the global existence of strong solution and show the existence of optimal control.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.5
• /
• pp.748-754
• /
• 2008

The general capacitor placement problem is a combinatorial optimization problem having an objective function composed of power losses and capacitor installation costs subject to bus voltage constraints. In this paper, a global optimization technique, which employing the chaos search algorithm, is applied to solve optimal capacitor placement problem with reducing computational effort and enhancing global optimality of the solution. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 9 buses and 69 buses system to illustrate the effectiveness of the proposed method.

• East Asian mathematical journal
• /
• v.38 no.1
• /
• pp.21-31
• /
• 2022

This paper is concerned with the optimal control problem associated to the self-organizing target detection model in 1D domains. That is, we show the global existence of weak solution and the existence of optimal control.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.225-228
• /
• 2001

DNA computing has been applied to the problem of getting an optimal solution since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems. This paper presents DNA coding method for finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms (GA). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses a tool of calculation or Information store with DNA molecules and four-type bases denoted by the symbols of A(Ademine), C(Cytosine), G(Guanine) and T(Thymine). The same operators, selection, crossover, mutation, are applied to the both DNA coding algorithm and genetic algorithms. The results show that the DNA based algorithm performs better than GA.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.358-367
• /
• 2003

We consider discrete-time factorial Markov Decision Processes (MDPs) in multiple decision-makers environment for infinite horizon average reward criterion with a general joint reward structure but a factorial joint state transition structure. We introduce the "localization" concept that a global MDP is localized for each agent such that each agent needs to consider a local MDP defined only with its own state and action spaces. Based on that, we present a gradient-ascent like iterative distributed algorithm that converges to a local optimal solution of the global MDP. The solution is an autonomous joint policy in that each agent's decision is based on only its local state.cal state.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.6
• /
• pp.325-332
• /
• 2003

The loss minimization is one of the most important problems to save the operational cost in distribution systems. This paper presents an efficient method for optimal feeder reconfiguration of distribution systems. Chaos search algorithm (CSA) is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off sectionalizing switches. In optimization problem, the CSA searches the global optimal solution on the basis of regularity in chaotic motions and easily escapes from local or near optimal solution. The CSA is tested on 15 buses and 32 buses distribution systems, and the results indicate that it is able to determine appropriate switching options for global optimum reconfiguration.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1086-1091
• /
• 2005

This paper focuses on intelligent control of induction motor by hybrid system consisting of GA-PSO. Induction motor has been using in industrial area. However, it is challengeable on how we control effectively. From this point, an optimal solution using GA (Genetic Algorithm) and PSO (Particle Swarm Optimization) is introduced to intelligent control. In this case, it is possible to obtain local solution because chromosomes or individuals which have only a close affinity can convergent. To improve an optimal learning solution of control, This paper deal with applying PSO and Euclidian data distance to mutation procedure on GA's differentiation. Through this approaches, we can have global and local optimal solution together, and the faster and the exact optimal solution without any local solution. Four test functions are used for proof of this suggested algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.432-435
• /
• 1995

In this paper a new approach to obtain the solution of the linear-quadratic Gaussian control problem for singularly perturbed discrete-time stochastic systems is proposed. The alogorithm proposed is based on exploring the previous results that the exact solution of the global discrete algebraic Riccati equations is found in terms of the reduced-order pure-slow and pure-fast nonsymmetric continuous-time algebraic Riccati equations and, in addition, the optimal global Kalman filter is decomposed into pure-slow and pure-fast local optimal filters both driven by the system measurements and the system optimal control input. It is shown that the optimal linear-quadratic Gaussian control problem for singularly perturbed linear discrete systems takes the complete decomposition and parallelism between pure-slow and pure-fast filters and controllers.