• Title/Summary/Keyword: Stochastic optimization

Search Result 386, Processing Time 0.033 seconds

Robust Kalman Filter Design via Selecting Performance Indices (성능지표 선정을 통한 강인한 칼만필터 설계)

  • Jung Jongchul;Huh Kunsoo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.1 s.232
    • /
    • pp.59-66
    • /
    • 2005
  • In this paper, a robust stationary Kalman filter is designed by minimizing selected performance indices so that it is less sensitive to uncertainties. The uncertainties include not only stochastic factors such as process noise and measurement noise, but also deterministic factors such as unknown initial estimation error, modeling error and sensing bias. To reduce the effect on the uncertainties, three performance indices that should be minimized are selected based on the quantitative error analysis to both the deterministic and the stochastic uncertainties. The selected indices are the size of the observer gain, the condition number of the observer matrix, and the estimation error variance. The observer gain is obtained by optimally solving the multi-objectives optimization problem that minimizes the indices. The robustness of the proposed filter is demonstrated through the comparison with the standard Kalman filter.

ROBUST PORTFOLIO OPTIMIZATION UNDER HYBRID CEV AND STOCHASTIC VOLATILITY

  • Cao, Jiling;Peng, Beidi;Zhang, Wenjun
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.6
    • /
    • pp.1153-1170
    • /
    • 2022
  • In this paper, we investigate the portfolio optimization problem under the SVCEV model, which is a hybrid model of constant elasticity of variance (CEV) and stochastic volatility, by taking into account of minimum-entropy robustness. The Hamilton-Jacobi-Bellman (HJB) equation is derived and the first two orders of optimal strategies are obtained by utilizing an asymptotic approximation approach. We also derive the first two orders of practical optimal strategies by knowing that the underlying Ornstein-Uhlenbeck process is not observable. Finally, we conduct numerical experiments and sensitivity analysis on the leading optimal strategy and the first correction term with respect to various values of the model parameters.

Intelligent Decision Support Algorithm for Uncertain Inventory Management

  • Le Ngoc Bao Long;Sam-Sang You;Truong Ngoc Cuong;Hwan-Seong Kim
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2023.05a
    • /
    • pp.254-255
    • /
    • 2023
  • This paper discovers a robust managerial strategy for a stochastic inventory of perishable products, where the model experiences changing factors including inner parameters and an external disturbance with unknown form. An analytical solution for the optimization problem can be obtained by applying the Hamilton-Bellman-Jacobi equation, however the policy result cannot completely suppress the oscillation from the external disturbance. Therefore, an intelligent approach named Radial Basis Function Neural Networks is applied to estimate the unknown disturbance and provide a robust controller to manipulate the inventory level more effective. The final results show the outstanding performance of RBFNN controller, where both the estimation error and control error are guaranteed in the predefined limit.

  • PDF

Design of the Well-Conditioned Observer - A Linear Matrix Inequality Approach - (Well-Conditioned 관측기 설계 - A Linear Matrix Inequality Approach -)

  • Jung, Jong-Chul;Huh, Kun-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.5
    • /
    • pp.503-510
    • /
    • 2004
  • In this paper, the well-conditioned observer for a stochastic system is designed so that the observer is less sensitive to the ill-conditioning factors in transient and steady-state observer performance. These factors include not only deterministic uncertainties such as unknown initial estimation error, round-off error, modeling error and sensing bias, but also stochastic uncertainties such as disturbance and sensor noise. In deterministic perspectives, a small value in the L$_{2}$ norm condition number of the observer eigenvector matrix guarantees robust estimation performance to the deterministic uncertainties. In stochastic viewpoints, the estimation variance represents the robustness to the stochastic uncertainties and its upper bound can be minimized by reducing the observer gain and increasing the decay rate. Both deterministic and stochastic issues are considered as a weighted sum with a LMI (Linear Matrix Inequality) formulation. The gain in the well-conditioned observer is optimally chosen by the optimization technique. Simulation examples are given to evaluate the estimation performance of the proposed observer.

Searching a global optimum by stochastic perturbation in error back-propagation algorithm (오류 역전파 학습에서 확률적 가중치 교란에 의한 전역적 최적해의 탐색)

  • 김삼근;민창우;김명원
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.3
    • /
    • pp.79-89
    • /
    • 1998
  • The Error Back-Propagation(EBP) algorithm is widely applied to train a multi-layer perceptron, which is a neural network model frequently used to solve complex problems such as pattern recognition, adaptive control, and global optimization. However, the EBP is basically a gradient descent method, which may get stuck in a local minimum, leading to failure in finding the globally optimal solution. Moreover, a multi-layer perceptron suffers from locking a systematic determination of the network structure appropriate for a given problem. It is usually the case to determine the number of hidden nodes by trial and error. In this paper, we propose a new algorithm to efficiently train a multi-layer perceptron. OUr algorithm uses stochastic perturbation in the weight space to effectively escape from local minima in multi-layer perceptron learning. Stochastic perturbation probabilistically re-initializes weights associated with hidden nodes to escape a local minimum if the probabilistically re-initializes weights associated with hidden nodes to escape a local minimum if the EGP learning gets stuck to it. Addition of new hidden nodes also can be viewed asa special case of stochastic perturbation. Using stochastic perturbation we can solve the local minima problem and the network structure design in a unified way. The results of our experiments with several benchmark test problems including theparity problem, the two-spirals problem, andthe credit-screening data show that our algorithm is very efficient.

  • PDF

A Global Optimization Technique for the Capacitor Placement in Distribution Systems (배전계통 커패시터 설치를 위한 전역적 최적화 기법)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;Lee, Sang-Keun
    • 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.

Adaptive Cross-Layer Resource Optimization in Heterogeneous Wireless Networks with Multi-Homing User Equipments

  • Wu, Weihua;Yang, Qinghai;Li, Bingbing;Kwak, Kyung Sup
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.784-795
    • /
    • 2016
  • In this paper, we investigate the resource allocation problem in time-varying heterogeneous wireless networks (HetNet) with multi-homing user equipments (UE). The stochastic optimization model is employed to maximize the network utility, which is defined as the difference between the HetNet's throughput and the total energy consumption cost. In harmony with the hierarchical architecture of HetNet, the problem of stochastic optimization of resource allocation is decomposed into two subproblems by the Lyapunov optimization theory, associated with the flow control in transport layer and the power allocation in physical (PHY) layer, respectively. For avoiding the signaling overhead, outdated dynamic information, and scalability issues, the distributed resource allocation method is developed for solving the two subproblems based on the primal-dual decomposition theory. After that, the adaptive resource allocation algorithm is developed to accommodate the timevarying wireless network only according to the current network state information, i.e. the queue state information (QSI) at radio access networks (RAN) and the channel state information (CSI) of RANs-UE links. The tradeoff between network utility and delay is derived, where the increase of delay is approximately linear in V and the increase of network utility is at the speed of 1/V with a control parameter V. Extensive simulations are presented to show the effectiveness of our proposed scheme.

Layered-earth Resistivity Inversion of Small-loop Electromagnetic Survey Data using Particle Swarm Optimization (입자 군집 최적화법을 이용한 소형루프 전자탐사 자료의 층서구조 전기비저항 역해석)

  • Jang, Hangilro
    • Geophysics and Geophysical Exploration
    • /
    • v.22 no.4
    • /
    • pp.186-194
    • /
    • 2019
  • Deterministic optimization, commonly used to find the geophysical inverse solutions, have its limitation that it cannot find the proper solution since it might converge into the local minimum. One of the solutions to this problem is to use global optimization based on a stochastic approach, among which a large number of particle swarm optimization (PSO) applications have been introduced. In this paper, I developed a geophysical inversion algorithm applying PSO method for the layered-earth resistivity inversion of the small-loop electromagnetic (EM) survey data and carried out numerical inversion experiments on synthetic datasets. From the results, it is confirmed that the PSO inversion algorithm could increase the inversion success rate even when attempting the inversion of small-loop EM survey data from which it might be difficult to find a best solution by applying the Gauss-Newton inversion algorithm.

Economic Life Assessment of Power Transformer using HS Optimization Algorithm (HS 최적화 알고리즘을 이용한 전력용 변압기의 경제적 수명평가)

  • Lee, Tae-bong;Shon, Jin-geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.66 no.3
    • /
    • pp.123-128
    • /
    • 2017
  • Electric utilities has been considered the necessity to introduce AM(asset management) of electric power facilities in order to reduce maintenance cost of existing facilities and to maximize profit. In order to make decisions in terms of repairs and replacements for power transformers, not only measuring by counting parts and labor costs, but comprehensive comparison including reliability and cost is needed. Therefore, this study is modeling input cost for power transformer during its entire life and also the life cycle cost (LCC) technique is applied. In particular, this paper presents an application of heuristic harmony search(HS) optimization algorithm to the convergence and the validity of economic life assessment of power transformer from LCC technique. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through an economic life assessment simulation of power transformer using HS optimization algorithm.