• Title/Summary/Keyword: duality scheme

Search Result 37, Processing Time 0.023 seconds

VISCOSITY APPROXIMATIONS FOR NONEXPANSIVE NONSELF-MAPPINGS IN BANACH SPACES

  • Jung, Jong-Soo
    • East Asian mathematical journal
    • /
    • v.26 no.3
    • /
    • pp.337-350
    • /
    • 2010
  • Strong convergence theorem of the explicit viscosity iterative scheme involving the sunny nonexpansive retraction for nonexpansive nonself-mappings is established in a reflexive and strictly convex Banach spaces having a weakly sequentially continuous duality mapping. The main result improves the corresponding result of [19] to the more general class of mappings together with certain different control conditions.

Practical Security Evaluation against Differential and Linear Cryptanalyses for the Lai-Massey Scheme with an SPS F-function

  • Fu, Lishi;Jin, Chenhui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3624-3637
    • /
    • 2014
  • At SAC 2004, Junod and Vaudenay designed the FOX family based on the Lai-Massey scheme. They noted that it was impossible to find any useful differential characteristic or linear trail after 8 rounds of FOX64 or FOX128. In this paper, we provide the lower bound of differentially active S-boxes in consecutive rounds of the Lai-Massey scheme that has SPS as its F-function, and we propose the necessary conditions for the reachability of the lower bound. We demonstrate that similar results can be obtained with respect to the lower bound of linearly active S-boxes by proving the duality in the Lai-Massey scheme. Finally, we apply these results to FOX64 and FOX128 and prove that it is impossible to find any useful differential characteristics or linear trail after 6 rounds of FOX64. We provide a more precise security bound for FOX128.

DUALITY FOR LINEAR CHANCE-CONSTRAINED OPTIMIZATION PROBLEMS

  • Bot, Radu Ioan;Lorenz, Nicole;Wanka, Gert
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.1
    • /
    • pp.17-28
    • /
    • 2010
  • In this paper we deal with linear chance-constrained optimization problems, a class of problems which naturally arise in practical applications in finance, engineering, transportation and scheduling, where decisions are made in presence of uncertainty. After giving the deterministic equivalent formulation of a linear chance-constrained optimization problem we construct a conjugate dual problem to it. Then we provide for this primal-dual pair weak sufficient conditions which ensure strong duality. In this way we generalize some results recently given in the literature. We also apply the general duality scheme to a portfolio optimization problem, a fact that allows us to derive necessary and sufficient optimality conditions for it.

VISCOSITY METHODS OF APPROXIMATION FOR A COMMON SOLUTION OF A FINITE FAMILY OF ACCRETIVE OPERATORS

  • Chen, Jun-Min;Zhang, Li-Juan;Fan, Tie-Gang
    • East Asian mathematical journal
    • /
    • v.27 no.1
    • /
    • pp.11-21
    • /
    • 2011
  • In this paper, we try to extend the viscosity approximation technique to find a particular common zero of a finite family of accretive mappings in a Banach space which is strictly convex reflexive and has a weakly sequentially continuous duality mapping. The explicit viscosity approximation scheme is proposed and its strong convergence to a solution of a variational inequality is proved.

MODIFIED LAGRANGE FUNCTIONAL FOR SOLVING ELASTIC PROBLEM WITH A CRACK IN CONTINUUM MECHANICS

  • Namm, Robert V.;Tsoy, Georgiy I.;Woo, Gyungsoo
    • Communications of the Korean Mathematical Society
    • /
    • v.34 no.4
    • /
    • pp.1353-1364
    • /
    • 2019
  • Modified Lagrange functional for solving an elastic problem with a crack is considered. Two formulations of a crack problem are investigated. The first formulation concerns a problem where a crack extending to the outer boundary of the domain. In the second formulation, we consider a problem with an internal crack. Duality ratio is established for initial and dual problem in both cases.

Transceiver Design Using Local Channel State Information at Relays for A Multi-Relay Multi-User MIMO Network

  • Cho, Young-Min;Yang, Janghoon;Kim, Dong Ku
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2616-2635
    • /
    • 2013
  • In this paper, we propose an iterative transceiver design in a multi-relay multi-user multiple-input multiple-output (MIMO) system. The design criterion is to minimize sum mean squared error (SMSE) under relay sum power constraint (RSPC) where only local channel state information (CSI)s are available at relays. Local CSI at a relay is defined as the CSI of the channel between BS and the relay in the $1^{st}$ hop link, and the CSI of the channel between the relay and all users in the $2^{nd}$ hop link. Exploiting BS transmitter structure which is concatenated with block diagonalization (BD) precoder, each relay's precoder can be determined using local CSI at the relay. The proposed scheme is based on sequential iteration of two stages; stage 1 determines BS transmitter and relay precoders jointly with SMSE duality, and stage 2 determines user receivers. We verify that the proposed scheme outperforms simple amplify-and-forward (SAF), minimum mean squared error (MMSE) relay, and an existing good scheme of [13] in terms of both SMSE and sum-rate performances.

STRONG CONVERGENCE OF COMPOSITE ITERATIVE METHODS FOR NONEXPANSIVE MAPPINGS

  • Jung, Jong-Soo
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.6
    • /
    • pp.1151-1164
    • /
    • 2009
  • Let E be a reflexive Banach space with a weakly sequentially continuous duality mapping, C be a nonempty closed convex subset of E, f : C $\rightarrow$C a contractive mapping (or a weakly contractive mapping), and T : C $\rightarrow$ C a nonexpansive mapping with the fixed point set F(T) ${\neq}{\emptyset}$. Let {$x_n$} be generated by a new composite iterative scheme: $y_n={\lambda}_nf(x_n)+(1-{\lambda}_n)Tx_n$, $x_{n+1}=(1-{\beta}_n)y_n+{\beta}_nTy_n$, ($n{\geq}0$). It is proved that {$x_n$} converges strongly to a point in F(T), which is a solution of certain variational inequality provided the sequence {$\lambda_n$} $\subset$ (0, 1) satisfies $lim_{n{\rightarrow}{\infty}}{\lambda}_n$ = 0 and $\sum_{n=0}^{\infty}{\lambda}_n={\infty}$, {$\beta_n$} $\subset$ [0, a) for some 0 < a < 1 and the sequence {$x_n$} is asymptotically regular.