• Title/Summary/Keyword: iterative algorithms

Search Result 352, Processing Time 0.019 seconds

SOME ITERATIVE ALGORITHMS FOR THE GENERALIZED MIXED EQUILIBRIUM-LIKE PROBLEMS

  • Liu, Zeqing;Chen, Zhengsheng;Kang, Shin-Min
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.3_4
    • /
    • pp.481-491
    • /
    • 2008
  • In this paper, we introduce and analyze a new class of generalized mixed equilibrium-like problems. By using the auxiliary principle technique, we suggest three iterative algorithms for the generalized mixed equilibrium-like problem. Under certain conditions, we establish the convergence of the iterative algorithms. Our results extend, improve and unify several known results in this field.

  • PDF

ITERATIVE ALGORITHMS FOR THE LEAST-SQUARES SYMMETRIC SOLUTION OF AXB = C WITH A SUBMATRIX CONSTRAINT

  • Wang, Minghui;Feng, Yan
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.1-12
    • /
    • 2009
  • Iterative algorithms are proposed for the least-squares symmetric solution of AXB = E with a submatrix constraint. We characterize the linear mappings from their independent element space to the constrained solution sets, study their properties and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods.

  • PDF

Low Latency Algorithms for Iterative Codes

  • Choi, Seok-Soon;Jung, Ji-Won;Bae, Jong-Tae;Kim, Min-Hyuk;Choi, Eun-A
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3C
    • /
    • pp.205-215
    • /
    • 2007
  • This paper presents low latency and/or computation algorithms of iterative codes of turbo codes, turbo product codes and low density parity check codes for use in wireless broadband communication systems. Due to high coding complexity of iterative codes, this paper focus on lower complexity and/or latency algorithms that are easily implementable in hardware and further accelerate the decoding speed.

STRONG CONVERGENCE OF GENERAL ITERATIVE ALGORITHMS FOR NONEXPANSIVE MAPPINGS IN BANACH SPACES

  • Jung, Jong Soo
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.1031-1047
    • /
    • 2017
  • In this paper, we introduce two general iterative algorithms (one implicit algorithm and other explicit algorithm) for nonexpansive mappings in a reflexive Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm. Strong convergence theorems for the sequences generated by the proposed algorithms are established.

RESOLVENT EQUATIONS TECHNIQUE FOR VARIATIONAL INEQUALITIES

  • Noor, Muhammad-Aslam
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.2
    • /
    • pp.407-418
    • /
    • 1997
  • In this paper we establish the equivalence between the general resolvent equations and variational inequalities. This equiva-lence is used to suggest and analyze a number of iterative algorithms for solving variational inclusions. We also study the convergence criteria of the iterative algorithms. Our results include several pre-viously known results as special cases.

THREE STEP ITERATIVE ALGORITHMS FOR GENERALIZED QUASIVARIATIONAL INCLUSIONS

  • Park, Jong-Yeoul;Jeong, Jae-Ug
    • Bulletin of the Korean Mathematical Society
    • /
    • v.41 no.1
    • /
    • pp.1-11
    • /
    • 2004
  • In this paper, we suggest and analyze some new classes of three step iterative algorithms for solving generalized quasivariational inclusions by using the properties of proximal maps. Our results include the Ishikawa, Mann iterations for solving variational inclusions(inequalities) as special cases. The results obtained in this paper represent an improvement and significant refinement of previously known results [3, 5-8, 10, 14-18].

ITERATIVE ALGORITHMS WITH ERRORS FOR ZEROS OF ACCRETIVE OPERATORS IN BANACH SPACES

  • Jung, Jong-Soo
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.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].

ITERATIVE ALGORITHMS WITH ERRORS FOR NONEXPANSIVE MAPPINGS IN BANACH SPACES

  • Jung, Jong-Soo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.43 no.4
    • /
    • pp.771-790
    • /
    • 2006
  • The iterative algorithms with errors for nonexpansive mappings are investigated in Banach spaces. Strong convergence theorems for these algorithms are obtained. Our results improve the corresponding results in [5, 13-15, 23, 27-29, 32] as well as those in [1, 16, 19, 26] in framework of a Hilbert space.

Decentralized Iterative Learning Control in Large Scale Linear Dynamic Systems (대규모 선형 시스템에서의 비집중 반복 학습제어)

  • ;Zeungnam Bien
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.10
    • /
    • pp.1098-1107
    • /
    • 1990
  • Decentralized iterative learning control methods are presented for a class of large scale interconnected linear dynamic systems, in which iterative learning controller in each subsystem operates on its local subsystem exclusively with no exchange of information between subsystems. Suffcient conditions for convergence of the algorithms are given and numerical examples are illustrated to show the validity of the algorithms. In particular, the algorithms are useful for the systems having large uncertainty of inter-connected terms.

  • PDF