• Bulletin of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.435-444
• /
• 1996

Let X be a normed linear space and K be a nonempty subset of X.

• Journal of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.155-167
• /
• 1996

Let X be a compact Hausdorff space, C(X) denote the set of all continuous real valued functions on X and $\ell \in N$ be any natural number.

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

The aim of this paper is to give some simultaneous approximation properties as well as differential properties, Voronovskaya type theorem, several asymptotic formulae for the partial derivative and the degree of approximation for two dimensional Lupas type operators.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.1
• /
• pp.14-19
• /
• 2008

The paper presents an intelligent time series model to predict uncertain electricity market price in the deregulated industry environment. Since the price of electricity in a deregulated market is very volatile, it is difficult to estimate an accurate market price using historically observed data. The parameter of an intelligent time series model is obtained based on the simultaneous perturbation stochastic approximation (SPSA). The SPSA is flexible to use in high dimensional systems. Since prediction models have their modeling error, an error compensator is developed as compensation. The SPSA based intelligent model is applied to predict the electricity market price in the Pennsylvania-New Jersey-Maryland (PJM) electricity market.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.506-514
• /
• 2008

This paper presents an intelligent model; named as free model, approach for a closed-loop system identification using input and output data and its application to design a power system stabilizer (PSS). The free model concept is introduced as an alternative intelligent system technique to design a controller for such dynamic system, which is complex, difficult to know, or unknown, with input and output data only, and it does not require the detail knowledge of mathematical model for the system. In the free model, the data used has incremental forms using backward difference operators. The parameters of the free model can be obtained by simultaneous perturbation stochastic approximation (SPSA) method. A linear transformation is introduced to convert the free model into a linear model so that a conventional linear controller design method can be applied. In this paper, the feasibility of the proposed method is demonstrated in a one-machine infinite bus power system. The linear quadratic regulator (LQR) method is applied to the free model to design a PSS for the system, and compared with the conventional PSS. The proposed SPSA-based LQR controller is robust in different loading conditions and system failures such as the outage of a major transmission line or a three phase to ground fault which causes the change of the system structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.81-98
• /
• 2013

Since Probabilistic Latent Semantic Analysis (PLSA) and Latent Dirichlet Allocation (LDA) were introduced, many revised or extended topic models have appeared. Due to the intractable likelihood of these models, training any topic model requires to use some approximation algorithm such as variational approximation, Laplace approximation, or Markov chain Monte Carlo (MCMC). Although these approximation algorithms perform well, training a topic model is still computationally expensive given the large amount of data it requires. In this paper, we propose a new method, called non-simultaneous sampling deactivation, for efficient approximation of parameters in a topic model. While each random variable is normally sampled or obtained by a single predefined burn-in period in the traditional approximation algorithms, our new method is based on the observation that the random variable nodes in one topic model have all different periods of convergence. During the iterative approximation process, the proposed method allows each random variable node to be terminated or deactivated when it is converged. Therefore, compared to the traditional approximation ways in which usually every node is deactivated concurrently, the proposed method achieves the inference efficiency in terms of time and memory. We do not propose a new approximation algorithm, but a new process applicable to the existing approximation algorithms. Through experiments, we show the time and memory efficiency of the method, and discuss about the tradeoff between the efficiency of the approximation process and the parameter consistency.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.139-147
• /
• 2009

We study the neural network approximation to a function in $C^1$[0, 1] and its derivative. In [3], we used even trigonometric polynomials in order to get an approximation order to a function in $L_p$ space. In this paper, we show the simultaneous approximation order to a function in $C^1$[0, 1] using a Bernstein polynomial and a feedforward neural network. Our proofs are constructive.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.367-376
• /
• 1996

We characterize best simultaneous approximations from a finite-dimensional subspace of a normed linear space. In the characterization we reveal usefulness of a minimax theorem presented in [2,4].

• Journal of the Korean Statistical Society
• /
• v.16 no.1
• /
• pp.45-51
• /
• 1987

The condition that two hyper-ellipsoids have no points in common is derived using the simultaneous diagonalization of the two hyper-ellipsoids. It is observed that the simultaneous diagonalization is composed of rotation and extension followed by another rotation. An approximation to this condition in terms of the generalized distance is discussed.

• Structural Engineering and Mechanics
• /
• v.76 no.6
• /
• pp.799-821
• /
• 2020

The optimum design of truss structures is one of the significant categories in structural optimization that has widely been applied by researchers. In the present study, new mathematical programming called Consistent Approximation (CONAP) method is utilized for the simultaneous optimization of the size and shape of truss structures. The CONAP algorithm has already been introduced to optimize some structures and functions. In the CONAP algorithm, some important parameters are designed by employing design sensitivities to enhance the capability of the method and its consistency in various optimum design problems, especially structural optimization. The cross-sectional area of the bar elements and the nodal coordinates of the truss are assumed to be the size and shape design variables, respectively. The displacement, allowable stress and the Euler buckling stress are taken as the design constraints for the problem. In the proposed method, the primary optimization problem is replaced with a sequence of explicit sub-problems. Each sub-problem is efficiently solved using the sequential quadratic programming (SQP) algorithm. Several truss structures are designed by employing the CONAP method to illustrate the efficiency of the algorithm for simultaneous shape and size optimization. The optimal solutions are compared with some of the mathematical programming algorithms, the approximation methods and metaheuristic algorithms those reported in the literature. Results demonstrate that the accuracy of the optimization is improved and the convergence rate speeds up.