• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.369-389
• /
• 2006

The iterative algorithms with errors for solutions to accretive operator inclusions are investigated in Banach spaces, including a modification of Rockafellar's proximal point algorithm. Some applications are given in Hilbert spaces. Our results improve the corresponding results in [1, 15-17, 29, 35].

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.909-920
• /
• 2011

A regularized Newton method for nonlinear ill-posed problems is considered. In each Newton step an implicit iterative method with an appropriate stopping rule is proposed and analyzed. Under certain assumptions on the nonlinear operator, the convergence of the algorithm is proved and the algorithm is stable if the discrepancy principle is used to terminate the outer iteration. Numerical experiment shows the effectiveness of the method.

• 대한수학회논문집
• /
• 제21권2호
• /
• pp.237-251
• /
• 2006

In this paper, we introduce and study a new iterative algorithm for approximating zeroes of accretive operators in Banach spaces.

• Kyungpook Mathematical Journal
• /
• 제62권1호
• /
• pp.89-106
• /
• 2022

We are concerned with finding a common solution to an equilibrium problem associated with a bifunction, and a constrained convex minimization problem. We propose an iterative fixed point algorithm and prove that the algorithm generates a sequence strongly convergent to a common solution. The common solution is identified as the unique solution of a certain variational inequality.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.534-540
• /
• 1993

In this paper, we present an iterative learning method of compensating for position sensor error. The previously known compensation algrithms need a special perfect position sensor or a priori information about error sources, while ours does not. To our best knowledge, any iterative learning approach has not been taken for sensor error compensation. Furthermore, our iterative learning algorithm does not have the drawbacks of the existing iterative learning control theories. To be more specific, our algorithm learns a uncertain function inself rather than its special time-trajectory and does not request the derivatives of measurement signals. Moreover, it does not require the learning system to start with the same initial condition for all iterations. To illuminate the generality and practical use of our algorithm, we give the rigorous proof for its convergence and some experimental results.

• 한국광학회:학술대회논문집
• /
• 한국광학회 2001년도 하계학술발표회
• /
• pp.80-81
• /
• 2001

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.444-447
• /
• 2004

A new approach to compute the control moves in Extended Dynamic Matrix Control (EDMC) is presented. In this approach, the number of variables, determined in the inner loop of the control algorithm using iterative methods, is reduced from P , the prediction horizon to M , the control horizon. Since M is usually much smaller than P , this modifies the control algorithm from computational point of view. To justify the modification, the computational requirements are compared to those of the existing EDMC algorithm.

• Kyungpook Mathematical Journal
• /
• 제55권4호
• /
• pp.933-951
• /
• 2015

In this paper, we consider the problem of convergence of an iterative algorithm for a general system of variational inequalities, a nonexpansive mapping and an ${\eta}$-strictly pseudo-contractive mapping. Strong convergence theorems are established in the framework of real Banach spaces.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제30권1호
• /
• pp.35-42
• /
• 1991

Multiobjective Optimisation problem involving set functions is introduced. Then an iterative algorithm for these kinds of problems is suggested and its optimal process will be proved.