• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.123-136
• /
• 2004

In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.

• Journal of the Korean Mathematical Society
• /
• v.40 no.1
• /
• pp.29-40
• /
• 2003

Let K be a nonempty closed bounded convex subset of an arbitrary smooth Banach space X and T : KlongrightarrowK be a strictly hemi-contractive operator. Under some conditions we obtain that the Mann iteration method with errors both converges strongly to a unique fixed point of T and is almost T-stable on K. The results presented in this paper generalize the corresponding results in [l]-[7], [20] and others.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.3-6
• /
• 2003

A nonlinear iterative filtering based on local statistics and anisotropic diffusion is introduced. Local statistics determines the diffusion coefficient at each iteration step. Anisotropic diffusion can be seen as estimates a piecewise smooth image from the noisy input image in the experimental section, our results are shown to suppress noise with preserving the edges. Therefore, it enhances the image and improves performance.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.4
• /
• pp.542-551
• /
• 1998

In this study, a method of error compensation for channel gain imbalance, phase imbalance and local oscillator leakage in the modulator of frequency direct conversion is suggested. The compensation of channel imbalance can be carried out by using the received power after transmitting test signal. By applying this method, the phase imbalance conversion with frequency can be easily compensated since this method is rarely affected by the transmission channel. It is confirmed that the algorithm proposed in this study(iteration coefficient=11) converges faster than conventional algorithm(iteration coefficient=43). From the numerical results, the DC-offset, channel gain, phase imbalance compensation coefficient and iteration number converges into($f_1$=0.0199999, $f_2$=-0.050001, $C_{22}$=0.9133, $C_{12}$=-0.0524, N=13) when the local oscillator leakage is not considered. However, it converges into($f_1$=-0.02, $f_2$=-2.2476, $C_{22}$=0.9133, $C_{12}$=-0.0524, N=16) when the local oscillator leakage is considered.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.27 no.1
• /
• pp.193-200
• /
• 2021

In this study, an analysis technique using static condensation is proposed for an efficient local nonlinear static analysis. The static condensation method is a model reduction method based on the degrees of freedom, and the analysis model is divided into a target part and a condensed part to be omitted. In this study, the nonlinear and linear parts were designated to the target and the omitted parts, respectively, and both the stiffness matrix and load vector corresponding to the linear part were condensed into the nonlinear part. After model condensation, the reduced model comprising the stiffness matrix and the load vector for the nonlinear part is constructed, and only this reduced model was updated through the Newton-Raphson iteration for an efficient nonlinear analysis. Finally, the efficiency and reliability of the proposed analysis technique were presented by applying it to various numerical examples.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.975-981
• /
• 2007

In this paper, we propose a spatially adaptive image restoration algorithm using local and statistics and estimated noise. The ratio of local mean, variance, and maximum values with different window size is used to constrain the solution space, and these parameters are computed at each iteration step using partially restored image. In addition, the additive noise estimated from partially restored image and the local constraints are used to determine a parameter for controlling the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed when compared to the non-adaptive algorithm. In addition, a smooth solution with a controlled degree of smoothness is obtained without a prior knowledge about the noise. Experimental results demonstrate that the proposed algorithm requires the similar iteration number to converge, but there is the improvement of SNR more than 0.2 dB comparing to the previous approach.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.443-448
• /
• 2013

Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the total frequency of visits of the currently selected node in the previous iteration. I used the ACS algoritm using subpath for search. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

• The Pure and Applied Mathematics
• /
• v.15 no.1
• /
• pp.47-55
• /
• 2008

Local convergence results for three Newton-like methods in Banach space are provided. A comparison is given between the three convergence radii. Then we show that using the largest convergence radius we can pick an initial guess from with we start the corresponding iteration. It turns out that after a finite number of steps we can always use the iterate found as the starting guess for a faster method, since this iterate will be inside the convergence domain of the new method.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.4
• /
• pp.603-611
• /
• 2003

In this paper we extend the definition of K-positive definite operators from linear to Frechet differentiable operators. Under this setting, we derive from the inverse function theorem a local existence and approximation results corresponding to those of Theorems land 2 of the authors [8], in an arbitrary real Banach space. Furthermore, an asymptotically K-positive definite operator is introduced and a simplified iteration sequence which converges to the unique solution of an asymptotically K-positive definite operator equation is constructed.

• The Pure and Applied Mathematics
• /
• v.12 no.3 s.29
• /
• pp.169-178
• /
• 2005

In this paper we study the existence and local asymptotic limit of the topological Chern-Simons vortices of the CP(1) model in $\mathbb{R}^2$. After reducing to semilinear elliptic partial differential equations, we show the existence of topological solutions using iteration and variational arguments & prove that there is a sequence of topological solutions which converges locally uniformly to a constant as the Chern­Simons coupling constant goes to zero and the convergence is exponentially fast.