• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.2
• /
• pp.82-88
• /
• 2005

A compensation scheme for a class of linearly parameterized systems is presented. The compensator consists of a typical linearizing control and an adaptive observer with integration type update law, which is based on Speed Gradient (SG) algorithm.. Instead of the intermediate functions of the compensation schemes suggested by other researchers, the proposed compensator is designed with some design functions which guarantee the growth, convexity, attainability, and pseudo gradient conditions in the update law. The scheme achieves the asymptotic stability of the tracking error and the boundedness of the estimation errors. A numerical example is given to demonstrate the validity of the proposed design.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.523-561
• /
• 2008

The purpose of this paper is to survey the use of the important method of scaling in analysis, and particularly in complex analysis. Applications are given to the study of automorophism groups, to canonical kernels, to holomorphic invariants, and to analysis in infinite dimensions. Current research directions are described and future paths indicated.

• The Pure and Applied Mathematics
• /
• v.8 no.2
• /
• pp.153-162
• /
• 2001

In this Paper, the notion of $\varepsilon$-Birkhoff orthogonality introduced by Dragomir [An. Univ. Timisoara Ser. Stiint. Mat. 29(1991), no. 1, 51-58] in normed linear spaces has been extended to metric linear spaces and a decomposition theorem has been proved. Some results of Kainen, Kurkova and Vogt [J. Approx. Theory 105 (2000), no. 2, 252-262] proved on e-near best approximation in normed linear spaces have also been extended to metric linear spaces. It is shown that if (X, d) is a convex metric linear space which is pseudo strictly convex and M a boundedly compact closed subset of X such that for each $\varepsilon$>0 there exists a continuous $\varepsilon$-near best approximation $\phi$ : X → M of X by M then M is a chebyshev set .

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.466-469
• /
• 1996

In this paper, we present the global minimization condition by an informal analysis of the Langevine competitive learning neural network. From the viewpoint of the stochastic process, it is important that competitive learning guarantees an optimal solution for pattern recognition. By analysis of the Fokker-Plank equation for the proposed neural network, we show that if an energy function has a special pseudo-convexity, Langevine competitive learning can find the global minima. Experimental results for pattern recognition of handwritten numeral data indicate the superiority of the proposed algorithm.

• Journal of the Korean Mathematical Society
• /
• v.61 no.2
• /
• pp.395-408
• /
• 2024

There have been numerous studies on the characteristics of the solutions of ordinary differential equations for optimization methods, including gradient descent methods and alternating direction methods of multipliers. To investigate computer simulation of ODE solutions, we need to trace pseudo-orbits by real orbits and it is called shadowing property in dynamics. In this paper, we demonstrate that the flow induced by the alternating direction methods of multipliers (ADMM) for a C² strongly convex objective function has the eventual shadowing property. For the converse, we partially answer that convexity with the eventual shadowing property guarantees a unique minimizer. In contrast, we show that the flow generated by a second-order ODE, which is related to the accelerated version of ADMM, does not have the eventual shadowing property.